Turing computations on ordinals
Bulletin of Symbolic Logic 11 (3):377-397 (2005)
| Abstract | We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel's constructible universe L. This characterization can be used to prove the generalized continuum hypothesis in L | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
|
| Through your library | Configure |
Gualtiero Piccinini (2003). Alan Turing and the Mathematical Objection. Minds and Machines 13 (1):23-48.
Paul Taylor (1996). Intuitionistic Sets and Ordinals. Journal of Symbolic Logic 61 (3):705-744.
Benjamin R. George (2006). Second-Order Characterizable Cardinals and Ordinals. Studia Logica 84 (3):425 - 449.
Michael Rathjen (2006). Theories and Ordinals in Proof Theory. Synthese 148 (3):719 - 743.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Jeremy Avigad (2002). An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations. Journal of Mathematical Logic 2 (01):91-112.
Pierluigi Minari, Mitio Takano & Hiroakira Ono (1990). Intermediate Predicate Logics Determined by Ordinals. Journal of Symbolic Logic 55 (3):1099-1124.
Jack Copeland (1999). Beyond the Universal Turing Machine. Australasian Journal of Philosophy 77 (1):46-67.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,381 of 549,070 )Recent downloads (6 months)1 ( #63,185 of 549,070 )How can I increase my downloads? |

