Vaught's theorem recursively revisited

DOI10.2307/2273632zbMath0493.03008OpenAlexW2125305054MaRDI QIDQ3955337

Terrence Millar

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273632

zbMATH Keywords

recursive isomorphism typeabstract isomorphism typerelationship between the number of countable and decidable models of a complete theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (2)

REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS ⋮ A computable ℵ₀-categorical structure whose theory computes true arithmetic

Cites Work

• A complete, decidable theory with two decidable models
• Unnamed Item

This page was built for publication: Vaught's theorem recursively revisited