Tame Theories with Hyperarithmetic Homogeneous Models

DOI10.2307/2046925MaRDI QIDQ3815287zbMATH OpenOpenAlexFDO

Authors Terrence Millar

Publication date 1989

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

zbMATH Keywords

decidable theoryhyperarithmetic hierarchyrecursive complexity of countable homogeneous modelsrecursive typetame theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Number of constructive homogeneous models of a complete decidable theory
• Computability of homogeneous models
• scientific article; zbMATH DE number 4016877
• scientific article; zbMATH DE number 4108740
• The degree spectra of homogeneous models

Cites work

• Bad models in nice neighborhoods
• Decidability and the number of countable models
• Foundations of recursive model theory
• Type Structure Complexity and Decidability

Cited in

(3)

• scientific article; zbMATH DE number 4016877 (Why is no real title available?)
• scientific article; zbMATH DE number 4108740 (Why is no real title available?)
• On the Minimality of Tame Models in the Isols

This page was built for publication: Tame Theories with Hyperarithmetic Homogeneous Models

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