PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (232)
Orphanage
Unclass'd
Unproven (519)
Corrections (21)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Low Entry average rating: No information on entry rating
Vaught's test (Theorem)

Let $ L$ be a first order language, and let $ S$ be a set of $ L$-sentences with no finite models which is $ \kappa$-categorical for some $ \kappa \geq \vert L\vert$. Then $ S$ is complete.



"Vaught's test" is owned by Evandar.
(view preamble | get metadata)

View style:

See Also: $\kappa$-categorical

Keywords:  model theory, logic

Attachments:
proof of Vaught's test (Proof) by Evandar
Log in to rate this entry.
(view current ratings)

Cross-references: finite, first order language

This is version 4 of Vaught's test, born on 2002-08-29, modified 2002-09-04.
Object id is 3391, canonical name is VaughtsTest.
Accessed 2028 times total.

Classification:
AMS MSC: 03C35 (Mathematical logic and foundations :: Model theory :: Categoricity and completeness of theories)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)