Computability and categoricity of ultrahomogeneous structures

DOI10.1007/978-3-319-08019-2_1MaRDI QIDQ5175872zbMATH OpenOpenAlexFDO

Authors Francis Adams, Douglas Cenzer

Publication date 25 February 2015

Published in Language, Life, Limits (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08019-2_1

zbMATH Keywords

computability theorycomputable model theoryeffective categoricityinjectionsultrahomogeneous

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computability and categoricity of weakly ultrahomogeneous structures
• Categoricity spectra of computable structures
• Computability-theoretic categoricity and Scott families
• The complexity of computable categoricity
• Effective categoricity of equivalence structures

Cited in

(8)

• Finite computable dimension and degrees of categoricity
• Categoricity spectra of computable structures
• Omega-categorical structures and their algebraic invariants
• Computability, Homotopy, and Twisted Cartesian Products
• A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
• Computable isomorphisms for certain classes of infinite graphs
• Computability and categoricity of weakly ultrahomogeneous structures
• Computable categoricity for algebraic fields with splitting algorithms

This page was built for publication: Computability and categoricity of ultrahomogeneous structures

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