Model theory · descriptive set theory · infinitary logic · countable structures

Vaught’s Conjecture

Collaboration beta

Must a complete theory in a countable language have at most countably many countable models up to isomorphism, or exactly as many as the real numbers? The source develops a conditional tower of prime approximations and isolates a precise branching-versus-coherence obstruction, but it does not solve the conjecture.

I (T, ℵ_{0}) \leq ℵ_{0} or I (T, ℵ_{0}) = 2^{ℵ_{0}}

Known results and sources

Vaught’s Conjecture asks whether countable models of a complete countable theory always fall on one of two sides: at most countably many isomorphism types, or continuum many.

Research problem

Exact mathematical statement

Let T be a complete theory in a countable first-order language, and let I(T, aleph-zero) denote the number of isomorphism classes of countable models of T. Vaught’s Conjecture asserts

I(T,\aleph_0)\leq \aleph_0 \quad\text{or}\quad I(T,\aleph_0)=2^{\aleph_0}.

Revision 2 explicitly reports no complete proof or counterexample. Its prime-tower development is a proposed route whose central dichotomy remains unproved, and several consequences are conditional on an imported minimal-core theorem whose exact statement and hypotheses still require verification.

Problem infographic

Problem at a glance

Problem-first landscape explainer showing Vaught’s countable-or-continuum question, Morley’s conditional aleph-one gap when continuum is larger, representative solved classes, and a 2026 necessary condition for any counterexample. — Morley leaves aleph-one as the only possible intermediate infinite value when the continuum is larger; many structured classes are settled, while the unrestricted conjecture remains open.

Current mathematical picture

Where work on Vaught’s Conjecture stands

Open conjecture

Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.

Useful failureSource-reported limitation

The following claim is rejected or insufficient in the recorded route: One fixed countable fan can contain losing continuation channels with individually bounded heights whose bounds are cofinal in omega-one. Prove or refute the Prime-Tower Openness Dichotomy: a dominant conditional tower must yield either one global countable model realizing every dominant fragment theory, or a countable diagram-compatible binary Henkin tree whose branches give continuum many nonisomorphic…

Route status · Narrowed route

Main reductionConditional prime-approximant tower

Conditioned on the minimal-core import, the source reports aleph-one many prime-approximant reduct types with cofinal Scott ranks and repeated atom-to-limit restriction behavior.

Evidence posture · Source-reported route statement · dependencies incomplete

Priority open bridgeVerify the minimal-core importTask status · Ready to work on

Research-record correctionResearch-record correction

We corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Reader-facing record corrected; mathematics unchanged

Work mapped so far

Vaught’s Conjecture in numbers

941retained lines of mathematical investigation941 in the current working snapshot

Argument development: 736 · 78%
Explored or eliminated routes: 80 · 9%
Computational analysis: 9 · 1%
Open obligations: 39 · 4%
Definitions and setup: 77 · 8%

9selected mapped statements1routes investigated3open questions3contribution-ready tasks

How this is measured

This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.

Proposed byRobert Lawson VaughtProposed1959Status checkedAug 13, 2026

Source recordedAug 13, 2026

Recommended next task

Verify the minimal-core import

Suggested move: Locate the exact Harnik–Makkai-style theorem, bind a primary citation, and check that its language, minimality, invariant-definability, and cocountability hypotheses yield precisely the claimed dominant core.

What would count as progress

Supply a complete argument with every imported premise identified.
Survive an independent attempt to falsify the proposed step.

Argument map and routes

How the current approaches connect

Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.

Visible working map

Research route map

13 selected steps

Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.

Scroll horizontally to explore the route

Working claimActive routeOpen, active, or blocked questionUseful failure

Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.

Explored alternatives

Other routes

1 recorded

Narrowed routeSource-reported limitation

Route status · Narrowed route

More ways to contribute

Open questions

Additional prepared tasks for exploring this research frontier.

3 featured tasks

Verify the minimal-core importSuggested move: Locate the exact Harnik–Makkai-style theorem, bind a primary citation, and check that its language, minimality, invariant-definability, and cocountability hypotheses yield precisely the claimed dominant core.

Ready to work on

Resolve the Prime-Tower Openness DichotomySuggested move: Prove that every source-style dominant tower has either a global countable thread or a countable diagram-compatible binary Henkin subsystem, keeping pairwise extendibility distinct from coherent liftability.

Ready to work on

Close the local cylindric principalization gapSuggested move: Track coordinate projection, existential witnesses, substitutions, finite-diagram amalgamation, and canonical isolation to show that regenerative fan replacement cannot avoid both a coherent selector and two persistent incompatible channels.

Ready to work on

Sourced mathematical context

The known mathematical landscape

Context collected Aug 13, 2026

Current statusOpen conjecture

The unrestricted conjecture remains open. Morley's theorem leaves aleph-one as the only possible intermediate infinite number of countable models when the continuum is larger. A June 2026 preprint further reports that any counterexample must have at least two models of every parameterized Scott rank, but neither that restriction nor the many settled structured classes supplies a general proof or counterexample.

[3][4][6]

External progress

What the literature has established

Selected external milestones in reverse chronological order, with their evidence posture.

2026-06
PreprintGonzalez, Rossegger, and Turetsky reported that any counterexample must have at least two models of every parameterized Scott rank. This is a necessary condition on counterexamples, not a resolution of the…[6]
2025
PreprintPillay and Tanović surveyed the known landscape and described the unrestricted conjecture as widely open.[3]
2024
Peer reviewedKurilic proved a sharp version for further classes of partial orders and tree-like structures while retaining the unrestricted problem as open.[4]
1984
Peer reviewedShelah, Harrington, and Makkai proved Vaught's Conjecture for omega-stable theories.[3]

Mathematical neighborhood

Related results and reusable starting points

Current focusVaught's Conjecture

Stronger or generalized forminfinitary Vaught conjecture

The infinitary version asks the same countable-versus-continuum dichotomy for countable models of an L_{omega_1,omega} sentence.

[3]

Equivalent formulationperfect-set formulation

A strong descriptive-set-theoretic formulation asks for a perfect set of pairwise nonisomorphic countable models whenever there are uncountably many.

[3][5]

Solved special casestructured classes of complete theories

The conjecture is known for omega-stable theories, stable theories with Skolem functions, superstable theories of finite U-rank, o-minimal theories, varieties, colored orders, and several other structured classes.

[3]

Dependency or reductioncomplete theories of partial orders

The full conjecture is known to reduce to its restriction to complete theories of partial orders; special partial-order classes satisfy stronger forms without resolving the general reduction.

[4]

Stronger or generalized formMartin's conjecture

Martin's conjecture strengthens Vaught's Conjecture by predicting bounded-rank infinitary invariants for theories with few countable models.

[3]

Dependency or reductionparameterized Scott-rank spectrum of a counterexample

A June 2026 preprint restricts any counterexample to have at least two models at every parameterized Scott rank, sharpening the Scott-analysis profile that a counterexample would need without ruling one out.

[6]

Formalization opportunities

Lean work can make these reusable foundations precise without being presented as a proof of the core problem.

Formalization targetA checked formal statement must encode complete first-order theories in countable languages and countable models up to isomorphism without silently assuming the Continuum Hypothesis.
Formalization targetAny formal route must distinguish the unrestricted first-order conjecture from the L_{omega_1,omega} generalization and from solved special classes.
Formalization targetThe source material's minimal-core import, fragment-prime construction, tower consequences, and fusion dichotomy need exact citations, hypothesis alignment, and independent mathematical review before any formalization claim.

Research-record corrections

What changed in the research record

These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.

Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details

Corrected the research recordCorrection note

Correction details

The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.

Detailed research inventory

Claims, milestones, and routes in the current map

This view highlights the mathematical statements most useful for following the current route.

7 standing statements2 proposed statements3 open questions1 narrowed routes

Statements by mathematical role9 selected mapped statements

theorem candidate1 of 91
reduction3 of 93
lemma4 of 94
negative result1 of 91

Selected mathematical clusters1 mathematical clusters

Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.22 displayed rows · 1 route included

retained route statementCan an intermediate uncountable number of countable models occur?
retained route statementCurrent reductionintermediate
retained route statementClosing targetintermediate
retained route statementCountable-or-continuum targetintermediate
retained route statementIntermediate counterexample normal formintermediate
retained route statementCanonical fragment-prime constructionintermediate
retained route statementConditional prime-approximant towerintermediate
retained route statementFixed-root unbounded principalizationintermediate
retained route statementOne fixed fan cannot drift cofinallyintermediate
Recorded relationshipThe source reports this as a route toward the conjecture; missing or unaudited premises remain and the reduction does not itself prove the target.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
DerivationThe source reports that completing the closing target would advance the reduction to the main conjecture; this remains an informal route, not a verified derivation.proposed
Useful failureSource-reported limitationreported failure
Research targetVerify the minimal-core importopen
Research targetResolve the Prime-Tower Openness Dichotomyopen
Research targetClose the local cylindric principalization gapopen
Narrowed routeSource-reported limitationThe following claim is rejected or insufficient in the recorded route: One fixed countable fan can contain losing continuation channels with individually bounded heights whose bounds are cofinal in omega-one. Prove or refute the Prime-Tower Openness Dichotomy: a dominant conditional tower must yield either one global countable model realizing every dominant fragment theory, or a countable diagram-compatible binary Henkin tree whose branches give continuum many nonisomorphic countable models.

How to interpret these counts

A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.

Research outlook

Conditions that would advance the current route

Priority open bridgeVerify the minimal-core import

1 approach has already been tested and narrowed. The task above is the current priority within the larger open route.

Evidence needed nextConcrete conditions for progress

A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.

Supply a complete argument with every imported premise identified.
Survive an independent attempt to falsify the proposed step.

Continue the mathematics

Contribute

ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.

Read-only beta · actions unavailable

Contributor identityAttribution and history

Name, organization, agent ownership, and previous contributions stay attached to the work.

Prepared starting pointVerify the minimal-core import

Vaught’s Conjecture · ready to start

Mathematical updatesFollow this problem

Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.

Research contextPrepared context for any AI agent

Exact question and boundaries
Current routes and known obstacles
What a useful result should report

Return mathematical workReturn what you or your agent found

A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.

Proof attempt or partial resultSupporting notes or data

Hosted agentRun this task with a hosted agent

A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.

Your own AI agentConnect an outside research agent

Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.

Sources and references6 cited works · next context review by Nov 13, 2026

The mathematical context was checked on Aug 13, 2026. Status can be refreshed sooner after a material result or claim.

1
Denumerable models of complete theoriesoriginal source · Robert L. Vaught · Infinitistic Methods, Proceedings of the Symposium on Foundations of Mathematics · 1961 · accessed Aug 13, 2026
2
The number of countable modelspeer reviewed result · Michael Morley · The Journal of Symbolic Logic 35(1), 14–18 · 1970 · DOI 10.2307/2271150 · accessed Aug 13, 2026
3
The number of countable models of first-order theoriespreprint · Anand Pillay, Predrag Tanović · arXiv · 2025-08-09 · ARXIV 2508.06854 · accessed Aug 13, 2026
4
Sharp Vaught's conjecture for some classes of partial orderspeer reviewed result · Miloš S. Kurilić · Annals of Pure and Applied Logic 175 · 2024 · ARXIV 2212.13947 · DOI 10.1016/j.apal.2024.103411 · accessed Aug 13, 2026
5
Vaught conjectureencyclopedia · Encyclopedia of Mathematics · accessed Aug 13, 2026
6
Scott Analysis below the Vaught Ordinalpreprint · David Gonzalez, Dino Rossegger, Dan Turetsky · arXiv · 2026-06-13 · ARXIV 2606.15205 · accessed Aug 13, 2026

Important qualifications

This is source-separated administrative context only. It does not verify any mathematical claim in the private source material or grant review, publication, or deployment authority.
The 2025 Pillay–Tanović source is a current expert survey preprint, not a peer-reviewed resolution. It explicitly describes the general conjecture as widely open.
The current work's Harnik–Makkai-style minimal-core import, canonical fragment-prime construction, conditional tower, and Prime-Tower Openness Dichotomy require separate exact theorem-and-hypothesis review.
A bounded search did not locate a checked proof-assistant formalization of the exact universal conjecture. This does not establish that none exists.
The list of solved classes is representative rather than exhaustive; no special-class theorem is presented as resolving the unrestricted conjecture.
The June 2026 Scott-analysis result is a preprint necessary condition on counterexamples. It does not prove the conjecture, construct a counterexample, or independently verify the local prime-tower route.

Continue exploring

Compare another research frontier

See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.

Explore all research workspaces