Degrees of bi-embeddable categoricity
From MaRDI portal
Publication:4995600
DOI10.3233/COM-190289OpenAlexW3026366005MaRDI QIDQ4995600
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro, Nikolay Bazhenov
Publication date: 25 June 2021
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.03553
Cites Work
- Unnamed Item
- Unnamed Item
- Degrees that are not degrees of categoricity
- The complexity of computable categoricity
- Pairs of recursive structures
- Generic copies of countable structures
- Computable structures and the hyperarithmetical hierarchy
- Elementary bi-embeddability spectra of structures
- Computable bi-embeddable categoricity
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of bi-embeddable categoricity of equivalence structures
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Effective categoricity for distributive lattices and Heyting algebras
- Degrees of categoricity of computable structures
- Analytic equivalence relations and bi-embeddability
- Effective procedures in field theory
- Intrinsic bounds on complexity and definability at limit levels
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Lowness for isomorphism and degrees of genericity
- Bi‐embeddability spectra and bases of spectra
- Degrees that Are Low for Isomorphism
- Computable categoricity for algebraic fields with splitting algorithms
- Complete analytic equivalence relations
- Ranked structures and arithmetic transfinite recursion
- ∏ 0 1 Classes and Degrees of Theories
- Up to equimorphism, hyperarithmetic is recursive
This page was built for publication: Degrees of bi-embeddable categoricity
