Well-orders realized by C.E. equivalence relations

DOI10.1007/978-3-031-08740-0_2OpenAlexW4285242600MaRDI QIDQ2104248

M. V. Zubkov, Nikolay Bazhenov

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_2

zbMATH Keywords

equivalence relationcomputable structure theorywell-ordercomputable ordinalcomputably enumerable structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Computable structures and the hyperarithmetical hierarchy
• A journey to computably enumerable structures (tutorial lectures)
• Computable quotient presentations of models of arithmetic and set theory
• Effective inseparability and its applications
• The theory of ceers computes true arithmetic
• Graphs realised by r.e. equivalence relations
• Boolean algebras realized by c.e. equivalence relations
• A Survey on Universal Computably Enumerable Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• THE WORD PROBLEM
• Joins and meets in the structure of ceers
• Word problems and ceers

This page was built for publication: Well-orders realized by C.E. equivalence relations