Notre Dame Journal of Formal Logic

Infinite Time Decidable Equivalence Relation Theory

Samuel Coskey and Joel David Hamkins

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
Notre Dame J. Formal Logic Volume 52, Number 2 (2011), 203-228.

Dates
First available in Project Euclid: 28 April 2011

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1303995715

Digital Object Identifier
doi:10.1215/00294527-1306199

Zentralblatt MATH identifier
05903679

Mathematical Reviews number (MathSciNet)
MR2794652

Subjects
Primary: 03D30: Other degrees and reducibilities 03D65: Higher-type and set recursion theory 03E15: Descriptive set theory [See also 28A05, 54H05]

Keywords
set theory descriptive set theory infinite time computation equivalence relations

Citation

Coskey, Samuel; Hamkins, Joel David. Infinite Time Decidable Equivalence Relation Theory. Notre Dame J. Formal Logic 52 (2011), no. 2, 203--228. doi:10.1215/00294527-1306199. http://projecteuclid.org/euclid.ndjfl/1303995715.


Export citation