Type Structure Complexity and Decidability

DOI10.2307/1998751MaRDI QIDQ3955339zbMATH OpenOpenAlexFDO

Authors Terrence Millar

Publication date 1982

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

zbMATH Keywords

countable homogeneous modelprime modelrecursive typesrecursively saturated model

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of denumerable and separable structures (03C15) Properties of classes of models (03C52) Computable structure theory, computable model theory (03C57)

Cites work

• Foundations of recursive model theory
• Homogeneous models and decidability
• Model theory
• Recursively presentable prime models

Cited in

(2)

• Persistently Finite Theories with Hyperarithmetic Models
• Tame Theories with Hyperarithmetic Homogeneous Models

This page was built for publication: Type Structure Complexity and Decidability

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