Computable bi-embeddable categoricity

DOI10.1007/S10469-018-9511-8MaRDI QIDQ1731326zbMATH OpenOpenAlexWikidataFDO

Authors Nikolay Bazhenov, E. B. Fokina, Dino Rossegger, Luca San Mauro

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

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

Cites work

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

Cited in

(4)

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

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

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