Abstract
AbstractWe define the notion ofordinal computabilityby generalizing standard Turingcomputability 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'sconstructible universeL. This characterization can be used to prove the generalized continuum hypothesis inL.
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. Constructibility
2. Consistency of the Continuum Hypothesis. (AM-3)
3. Silver Jack H. , How to eliminate the fine structure from the work of Jensen, handwritten manuscript, 197?
4. Richardson Thomas Lloyd , Silver machine approach to the constructible universe, Ph.D. thesis, University of California, Berkeley, 1979.
5. Weak Second-Order Arithmetic and Finite Automata
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献