Borel graphable equivalence relations

DOI10.1016/J.AIM.2025.110765MaRDI QIDQ6862904zbMATH OpenFDO

Authors Tyler Arant, Alexander S. Kechris, Patrick Lutz

Publication date 6 February 2026

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AIM.2025.110765

zbMATH Keywords

analytic equivalence relationChurch-Kleene ordinaleffective descriptive set theoryinvariant descriptive set theoryKumabe-Slaman forcingPolish group

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Set theory (03Exx) Connections of general topology with other structures, applications (54Hxx)

Cites work

• Algorithmic randomness and complexity.
• An analytic equivalence relation not arising from a Polish group action
• Borel actions of Polish groups
• Defining the Turing jump
• Degree-invariant, analytic equivalence relations without perfectly many classes
• Degrees coded in jumps of orderings
• Descriptive set theory
• Dynamics of non-Archimedean Polish groups
• Effective randomness for continuous measures
• Equivalences Generated by Families of Borel Sets
• scientific article; zbMATH DE number 3825809 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 976831 (Why is no real title available?)
• Invariant descriptive set theory
• On linearly ordered sets and permutation groups of countable degree
• On surjectively universal Polish groups
• On the imbedding of topological groups into connected topological groups
• Proof of a Conjecture of Friedman
• Recursion theory. Computational aspects of definability
• The countable admissible ordinal equivalence relation
• The non-existence of Σ^1_2 well-orderings of the Cantor set
• The topological Vaught's conjecture and minimal counterexamples

This page was built for publication: Borel graphable equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862904)