Computable trees, prime models, and relative decidability

DOI10.1090/S0002-9939-05-08097-4MaRDI QIDQ3372136zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Prime models and almost decidability
• Degree spectra of prime models
• On decidable categoricity and almost prime models
• Effective prime uniqueness
• scientific article; zbMATH DE number 1302870

Cites work

• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• Bounding homogenous models
• Bounding prime models
• Degree spectra of prime models
• Enumerations, countable structures and Turing degrees
• Foundations of recursive model theory
• Recursively presentable prime models
• Relative to any nonrecursive set

Cited in

(11)

• The atomic model theorem and type omitting
• Constructing decidable graphs from decidable structures
• On decidable and computable models of theories
• Turing degrees of nonabelian groups
• Some Questions in Computable Mathematics
• On decidable categoricity and almost prime models
• Prime models and almost decidability
• Degrees of Indiscernibles in Decidable Models
• Relative to any non-hyperarithmetic set
• A computable structure with non-standard computability
• Effective prime uniqueness

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

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