Eventually infinite time turing machine degrees: Infinite time decidable reals

Journal of Symbolic Logic

Volumn 65, Issue 3, 2000, Pages 1193-1203

  Welch, P D ^a,b  

^a KOBE UNIVERSITY   (Japan)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034259557     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586695     Document Type: Article

References (8)

1. K.J. BARWISE, Admissible sets and structures, Perspectives in Mathematical Logic, Springer Verlag, Berlin, Heidelberg, 1975.
2. G. BOOLOS and R. JEFFREY, Compatibility and logic, Cambridge University Press, 1980.
3. K. DEVLIN, Constructibility, Perspectives in Mathematical Logic, Springer Verlag, Berlin, Heidelberg, 1984.
4. J.D. HAMKINS and A. LEWIS, Infinite time Turing machines, this JOURNAL, to appear.
5. _, Post's problem has both positive and negative solutions in the infinite time Turing degrees, submitted to the Archive for Mathematical Logic.
6. A.S. KECHRIS, The theory of countable analytic sets, Transactions of the American Mathematical Society, vol. 202 (1975), pp. 259-297.
7. P.D. WELCH, The length of infinite time Turing degree computations, Bulletin of the London Mathematical Society, vol. 32 (2000), no. 2, pp. 129-136.
8. _, Minimality arguments in the infinite time Turing degrees, Sets and proofs, Proceedings of the ASL European Meeting 1997 (S.B. Cooper and J.K. Truss, editors), London Mathematical Society Lecture Notes in Mathematics, vol. 258, Cambridge University Press, April 1999, pp. 425-436.