Computable trees, prime models, and relative decidability

DOI10.1090/S0002-9939-05-08097-4zbMath1099.03024OpenAlexW2077565563MaRDI QIDQ3372136

Denis R. Hirschfeldt

Publication date: 17 February 2006

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-05-08097-4

zbMATH Keywords

prime modelcomputable treecomplete decidable theoryisolated paths

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Turing degrees of nonabelian groups ⋮ On Decidable and Computable Models of Theories ⋮ Some Questions in Computable Mathematics ⋮ Constructing decidable graphs from decidable structures ⋮ The atomic model theorem and type omitting ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET

Cites Work

• Unnamed Item
• Bounding homogenous models
• Foundations of recursive model theory
• Recursively presentable prime models
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degree spectra of prime models
• Bounding prime models

This page was built for publication: Computable trees, prime models, and relative decidability