Theories with recursive models

DOI10.2307/2273704zbMath0423.03038OpenAlexW2110464795MaRDI QIDQ3856753

James H. Schmerl, Manuel Lerman

Publication date: 1979

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

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

zbMATH Keywords

arithmetical theoriescategorical theoriesrecursive modelstheories of treestheories of linear order

Mathematics Subject Classification ID

Models of other mathematical theories (03C65) Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)

Related Items (5)

Autostability of prime models under strong constructivizations ⋮ Complexity of Ehrenfeucht models ⋮ Recursive models and the divisibility poset ⋮ Theory of Abelian groups with constructive models ⋮ Building models of strongly minimal theories

Cites Work

• Decidable models
• Some aspects of generalized computability
• Foundations of recursive model theory

This page was built for publication: Theories with recursive models