Persistently Finite Theories with Hyperarithmetic Models

DOI10.2307/1999303MaRDI QIDQ3039332zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(5)

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

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

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