Computable trees, prime models, and relative decidability

DOI10.1090/S0002-9939-05-08097-4zbMATH Open1099.03024OpenAlexW2077565563MaRDI QIDQ3372136FDOQ3372136

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

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

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)

Cites Work

• Foundations of recursive model theory
• Title not available (Why is that?)
• Bounding prime models
• Recursively presentable prime models
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degree spectra of prime models
• Bounding homogenous models

Cited In (11)

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

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)