Vaught's theorem recursively revisited

DOI10.2307/2273632MaRDI QIDQ3955337zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A complete, decidable theory with two decidable models

Cited in

(2)

• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• Reverse mathematics of first-order theories with finitely many models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955337)