Infinite time decidable equivalence relation theory

DOI10.1215/00294527-1306199MaRDI QIDQ540407zbMATH OpenOpenAlexFDO

Authors Samuel Coskey, Joel David Hamkins

Publication date 3 June 2011

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.4616

zbMATH Keywords

descriptive set theoryequivalence relationsinfinite-time computation

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65) Descriptive set theory (03E15)

Abstract: We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time generalization of the countable Borel equivalence relations, a key subclass of the Borel equivalence relations, and again show that several key properties carry over to the larger class. Lastly, we collect together several results from the literature regarding Borel reducibility which apply also to absolutely Delta_1^2 reductions, and hence to the infinite time computable reductions.

Recommendations

• Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
• Infinite-time Turing machines and Borel reducibility
• A Survey of Infinite Time Turing Machines
• Infinite time computable model theory
• The effective theory of Borel equivalence relations

Cited in

(17)

• Infinitary definitions of equivalence relations in models of PA
• The recognizability strength of infinite time Turing machines with ordinal parameters
• Descriptive set theory, from Cantor to Wadge and beyond
• On computably enumerable structures
• Graphs realised by r.e. equivalence relations
• Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
• Infinite-time Turing machines and Borel reducibility
• The classification of countable models of set theory
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines
• Reducibilities among equivalence relations induced by recursively enumerable structures

This page was built for publication: Infinite time decidable equivalence relation theory

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