Tame Theories with Hyperarithmetic Homogeneous Models

DOI10.2307/2046925zbMath0664.03028OpenAlexW4238397990MaRDI QIDQ3815287

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)

Cites Work

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

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