Degrees of bi-embeddable categoricity of equivalence structures
From MaRDI portal
Publication:2312081
DOI10.1007/s00153-018-0650-3zbMath1477.03143arXiv1710.10927OpenAlexW2766922222MaRDI QIDQ2312081
Luca San Mauro, Dino Rossegger, Ekaterina B. Fokina, Nikolay Bazhenov
Publication date: 4 July 2019
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10927
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (8)
Bi‐embeddability spectra and bases of spectra ⋮ The complexity of finding supergraphs ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ Computable bi-embeddable categoricity ⋮ Degree spectra of structures relative to equivalences ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Degrees of bi-embeddable categoricity ⋮ Computable embeddability for algebraic structures
Cites Work
- Unnamed Item
- Finite computable dimension and degrees of categoricity
- Degrees of categoricity and the hyperarithmetic hierarchy
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Degrees of categoricity vs. strong degrees of categoricity
- Effective categoricity of equivalence structures
- Degrees of categoricity of computable structures
- Effective procedures in field theory
- On the Equimorphism Types of Linear Orderings
- d-computable categoricity for algebraic fields
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Bi‐embeddability spectra and bases of spectra
- Parallel Feedback Turing Computability
- Ranked structures and arithmetic transfinite recursion
- Up to equimorphism, hyperarithmetic is recursive
- Categoricity spectra for rigid structures
This page was built for publication: Degrees of bi-embeddable categoricity of equivalence structures
