Computable bi-embeddable categoricity

DOI10.1007/s10469-018-9511-8zbMath1485.03106OpenAlexW2903055266WikidataQ128894197 ScholiaQ128894197MaRDI QIDQ1731326

Luca San Mauro, Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger

Publication date: 13 March 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-018-9511-8

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Related Items (4)

On categoricity spectra for locally finite graphs ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Degrees of bi-embeddable categoricity ⋮ Computable embeddability for algebraic structures

Cites Work

• The complexity of computable categoricity
• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of bi-embeddable categoricity of equivalence structures
• Effective categoricity for distributive lattices and Heyting algebras
• Degrees of categoricity of computable structures
• Recursive isomorphism types of recursive Boolean algebras
• On the Equimorphism Types of Linear Orderings
• Recursively Categorical Linear Orderings
• Bi‐embeddability spectra and bases of spectra
• Ranked structures and arithmetic transfinite recursion
• Up to equimorphism, hyperarithmetic is recursive

This page was built for publication: Computable bi-embeddable categoricity