On Σ1 1 equivalence relations over the natural numbers

DOI10.1002/malq.201020063zbMath1241.03050OpenAlexW2087474410MaRDI QIDQ3117786

Ekaterina B. Fokina, Sy-David Friedman

Publication date: 29 February 2012

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201020063

zbMATH Keywords

equivalence relationshyperarithmetical setFF-reducibilityh-reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Comparing classes of finite sums ⋮ LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS ⋮ Agreement reducibility ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ A Friedberg enumeration of equivalence structures ⋮ Bi‐embeddability spectra and bases of spectra ⋮ FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS ⋮ On computably enumerable structures ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ Graphs realised by r.e. equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effective theory of Borel equivalence relations
• Computable categoricity and the Ershov hierarchy
• Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
• Recursively enumerable many-one degrees
• Effective categoricity of equivalence structures
• A Note on Positive Equivalence Relations
• A Borel reductibility theory for classes of countable structures
• Classifying positive equivalence relations
• The universal Lachlan semilattice without the greatest element
• On the Equimorphism Types of Linear Orderings
• New Directions in Descriptive Set Theory
• A Note on Borel Equivalence Relations
• Index sets for classes of high rank structures
• Comparing Classes of Finite Structures
• Computably enumerable equivalence relations