Persistently Finite Theories with Hyperarithmetic Models

DOI10.2307/1999303zbMath0525.03027OpenAlexW4236854827MaRDI QIDQ3039332

Terrence Millar

Publication date: 1983

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

zbMATH Keywords

hyperarithmetic degrees of countable modelspersistently finite theories

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Models with special properties (saturated, rigid, etc.) (03C50) Properties of classes of models (03C52) Models of other mathematical theories (03C65) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (3)

Persistently Finite, Persistently Arithmetic Theories ⋮ Autostability of prime models under strong constructivizations ⋮ A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

Cites Work

• Model theory
• Foundations of recursive model theory
• Type Structure Complexity and Decidability

This page was built for publication: Persistently Finite Theories with Hyperarithmetic Models