Omitting types, type spectrums, and decidability

DOI10.2307/2273331zbMath0516.03017OpenAlexW2031952547MaRDI QIDQ3663267

Terrence Millar

Publication date: 1983

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

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

zbMATH Keywords

omitting typesdecidable models

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57)

Related Items

On Decidable and Computable Models of Theories ⋮ Some Questions in Computable Mathematics ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ The atomic model theorem and type omitting ⋮ Decidability and the number of countable models

Cites Work

• Foundations of recursive model theory