On complete theories with a finite number of denumerable models

DOI10.1007/BF02218589MaRDI QIDQ1214409zbMATH OpenOpenAlexFDO

Authors Mikhaĭl G. Peretyat'kin

Publication date 1975

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/186812

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Other classical first-order model theory (03C68) Model theory (03C99) Computability and recursion theory (03D99)

Cites work

• Constructive models of complete solvable theories
• scientific article; zbMATH DE number 3458610 (Why is no real title available?)
• Natural models of set theories

Cited in

(19)

• Recursive categoricity and recursive stability
• There are four countable ultrahomogeneous graphs without triangles
• Decidable models
• Theories with only a finite number of existentially complete models
• Computable models of theories with few models
• On k-homogeneous posets and graphs
• A.D. Taimanov and model theory in Kazakhstan
• On constants and the strict order property
• Complexity of Ehrenfeucht models
• Finite extensions and the number of countable models
• On decidable and computable models of theories
• Hypergraphs of prime models and distributions of countable models of small theories
• Weakly binary expansions of dense meet‐trees
• Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
• Pseudo-countably-categorical formulas and theories
• Decidable models of Ehrenfeucht theories
• Limit models of Ehrenfeucht theories
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
• Theories with constants and three countable models

This page was built for publication: On complete theories with a finite number of denumerable models

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