On complete theories with a finite number of denumerable models
From MaRDI portal
Publication:1214409
DOI10.1007/BF02218589zbMath0298.02047OpenAlexW2040037595MaRDI QIDQ1214409
Publication date: 1975
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186812
Model theory (03C99) Computability and recursion theory (03D99) Categoricity and completeness of theories (03C35) Other classical first-order model theory (03C68)
Related Items
Recursive categoricity and recursive stability, On Decidable and Computable Models of Theories, Computable models of theories with few models, Theories with constants and three countable models, There are four countable ultrahomogeneous graphs without triangles, Weakly binary expansions of dense meet‐trees, Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types, Complexity of Ehrenfeucht models, Finite extensions and the number of countable models, Hypergraphs of prime models and distributions of countable models of small theories, On constants and the strict order property, On k-homogeneous posets and graphs, Decidable models, Theories with only a finite number of existentially complete models, A.D. Taimanov and model theory in Kazakhstan, A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
Cites Work
