# GetWiki

*Vaught conjecture*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

Vaught conjecture

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**Vaught conjecture**is a conjecture in the mathematical field of model theory originally proposed by Robert Lawson Vaught in 1961. It states that the number of countable models of a first-order complete theory in a countable language is finite or â„µ0 or 2{{sup|â„µ0}}. Morley showed that number of countable models is finite or â„µ0 or â„µ1 or 2{{sup|â„µ0}}, which solves the conjecture except for the case of â„µ1 models when the continuum hypothesis fails. For this remaining case, {{harvs|txt|first=Robin |last=Knight|year1=2002|year2=2007}} has announced a counterexample to the Vaught conjecture and the topological Vaught conjecture. As of 2016 the counterexample has not been verified.

## Statement of the conjecture

Let T be a first-order, countable, complete theory with infinite models. Let I(T, alpha) denote the number of models of T of cardinality alpha up to isomorphism, the spectrum of the theory T. Morley proved that if I(T,â„µ0) is infinite then it must be â„µ0 or â„µ1 or the cardinality of the continuum. The Vaught conjecture is the statement that it is not possible for aleph_{0} < I(T,aleph_{0}) < 2^{aleph_{0}}. The conjecture is a trivial consequence of the continuum hypothesis; so this axiom is often excluded in work on the conjecture. Alternatively there is a sharper form of the conjecture which states that any countable complete T with uncountably many countable models will have a perfect set of uncountable models (as pointed out by John Steel, in On Vaught's conjecture. Cabal Seminar 76â€”77 (Proc. Caltech-UCLA Logic Sem., 1976â€”77), pp. 193â€“208, Lecture Notes in Math., 689, Springer, Berlin, 1978, this form of the Vaught conjecture is equiprovable with the original).### Original formulation

The original formulation by Vaught was not stated as a conjecture, but as a problem:*Can it be proved, without the use of the continuum hypothesis, that there exists a complete theory having exactly â„µ1 non-isomorphic denumerable models?*By the result by Morley mentioned at the beginning, a positive solution to the conjecture essentially corresponds to a negative answer to Vaught's problem as originally stated.

## Vaught's theorem

Vaught proved that the number of countable models of a complete theory cannot be 2. It can be any finite number other than 2, for example:- Any complete theory with a finite model has no countable models.
- The theories with just one countable model are the Ï‰-categorical theories. There are many examples of these, such as the theory of an infinite set.
- Ehrenfeucht gave the following example of a theory with 3 countable models: the language has a relation â‰¥ and a countable number of constants
*c*0,*c*1, ...with axioms stating that â‰¥ is a dense unbounded total order, and*c*0<*c*1

**- content above as imported from Wikipedia**

- "

- time: 8:59am EST - Sun, Dec 16 2018

- "

__Vaught conjecture__" does not exist on GetWiki (yet)- time: 8:59am EST - Sun, Dec 16 2018

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

GETWIKI 18 AUG 2014

© 2018 M.R.M. PARROTT | ALL RIGHTS RESERVED