A complete, decidable theory with two decidable models

DOI10.2307/2273123zbMath0421.03026OpenAlexW2049591942MaRDI QIDQ3853605

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

decidable modelsrecursive model theorycomplete decidable theorycountable saturated model

Mathematics Subject Classification ID

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

Related Items (4)

REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory ⋮ Vaught's theorem recursively revisited

Cites Work

• Unnamed Item
• Foundations of recursive model theory

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