Infinite Time Decidable Equivalence Relation Theory
Notre Dame Journal of Formal Logic 52 (2):203-228 (2010)
| Abstract | 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesChristian Rosendal (2005). Cofinal Families of Borel Equivalence Relations and Quasiorders. Journal of Symbolic Logic 70 (4):1325 - 1340.
Slawomir Solecki (2000). Actions of Non-Compact and Non-Locally Compact Polish Groups. Journal of Symbolic Logic 65 (4):1881-1894.
Greg Hjorth (2005). Bi-Borel Reducibility of Essentially Countable Borel Equivalence Relations. Journal of Symbolic Logic 70 (3):979 - 992.
Longyun Ding & Su Gao (2006). Diagonal Actions and Borel Equivalence Relations. Journal of Symbolic Logic 71 (4):1081 - 1096.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Jeffrey S. Carroll (1990). Maximal R.E. Equivalence Relations. Journal of Symbolic Logic 55 (3):1048-1058.
Ramez L. Sami (1984). On ∑11 Equivalence Relations with Borel Classes of Bounded Rank. Journal of Symbolic Logic 49 (4):1273 - 1283.
Andrea Sorbi (1982). ∑0n-Equivalence Relations. Studia Logica 41 (4):351-358.
Claudio Bernardi & Andrea Sorbi (1983). Classifying Positive Equivalence Relations. Journal of Symbolic Logic 48 (3):529-538.
Kenneth L. Manders (1982). On the Space-Time Ontology of Physical Theories. Philosophy of Science 49 (4):575-590.
Simon Thomas (2007). Property Τ and Countable Borel Equivalence Relations. Journal of Mathematical Logic 7 (01):1-34.
S. Jackson, A. S. Kechris & A. Louveau (2002). Countable Borel Equivalence Relations. Journal of Mathematical Logic 2 (01):1-80.
Andrea Sorbi (1982). $\Sum_{0}^{N}$ -Equivalence Relations. Studia Logica 41 (4):351 - 358.
Theodore Hailperin (2011). Logic Semantics with the Potential Infinite. History and Philosophy of Logic 31 (2):145-159.
Analytics
Monthly downloads |
Added to index2011-04-29Total downloads6 ( #145,547 of 549,065 )Recent downloads (6 months)1 ( #63,185 of 549,065 )How can I increase my downloads? |
My notes
Discussion
