Notre Dame Journal of Formal Logic 52 (2):203-228 (2010)
We introduce an analogue 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
|Keywords||set theory descriptive set theory infinite time computation equivalence relations|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Graphs Realised by R.E. Equivalence Relations.Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan - 2014 - Annals of Pure and Applied Logic 165 (7-8):1263-1290.
Similar books and articles
Cofinal Families of Borel Equivalence Relations and Quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Actions of Non-Compact and Non-Locally Compact Polish Groups.Slawomir Solecki - 2000 - Journal of Symbolic Logic 65 (4):1881-1894.
Bi-Borel Reducibility of Essentially Countable Borel Equivalence Relations.Greg Hjorth - 2005 - Journal of Symbolic Logic 70 (3):979 - 992.
Diagonal Actions and Borel Equivalence Relations.Longyun Ding & Su Gao - 2006 - Journal of Symbolic Logic 71 (4):1081 - 1096.
Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
Maximal R.E. Equivalence Relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
On ∑11 Equivalence Relations with Borel Classes of Bounded Rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
Classifying Positive Equivalence Relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
On the Space-Time Ontology of Physical Theories.Kenneth L. Manders - 1982 - Philosophy of Science 49 (4):575-590.
Property Τ and Countable Borel Equivalence Relations.Simon Thomas - 2007 - Journal of Mathematical Logic 7 (1):1-34.
Countable Borel Equivalence Relations.S. Jackson, A. S. Kechris & A. Louveau - 2002 - Journal of Mathematical Logic 2 (01):1-80.
Added to index2011-04-29
Total downloads20 ( #246,003 of 2,163,993 )
Recent downloads (6 months)1 ( #348,017 of 2,163,993 )
How can I increase my downloads?