A complete, decidable theory with two decidable models

DOI10.2307/2273123MaRDI QIDQ3853605zbMATH OpenOpenAlexFDO

Authors Terrence Millar

Publication date 1979

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

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

zbMATH Keywords

complete decidable theorycountable saturated modeldecidable modelsrecursive model theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of denumerable and separable structures (03C15) Model theory (03C99) Computability and recursion theory (03D99)

Cites work

• Foundations of recursive model theory
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)

Cited in

(4)

• \(\mathsf{WKL}_0\) and induction principles in model theory
• Reverse mathematics of first-order theories with finitely many models
• Vaught's theorem recursively revisited
• Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types

This page was built for publication: A complete, decidable theory with two decidable models

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