ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
DOI10.1017/jsl.2022.28arXiv2105.12534MaRDI QIDQ6095972
Luca San Mauro, Unnamed Author, Uri Andrews
Publication date: 11 September 2023
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.12534
computably enumerable equivalence relationssecond-order arithmeticcomputable reducibilitycountable equivalence relations
Quantum computation (81P68) Weak interaction in quantum theory (81V15) Other degrees and reducibilities in computability and recursion theory (03D30) Recursive equivalence types of sets and structures, isols (03D50) Hierarchies of computability and definability (03D55) Dark matter and dark energy (83C56)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order theory of the degrees of recursive unsolvability
- Definability in the enumeration degrees
- The theory of ceers computes true arithmetic
- Classifying equivalence relations in the Ershov hierarchy
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies
- On the degree structure of equivalence relations under computable reducibility
- Turing Computability
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
- A Survey on Universal Computably Enumerable Equivalence Relations
- Borel Equivalence Relations
- Classifying positive equivalence relations
- The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
- Uniform Martin’s conjecture, locally
- Self-full ceers and the uniform join operator
- Joins and meets in the structure of ceers
- Measuring the complexity of reductions between equivalence relations
- Isomorphism relations on computable structures
- Computably enumerable equivalence relations
This page was built for publication: ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
