Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-comparison-of-two-systems-of-ordinal-notations-SpAA58m50z
References (26)
-
Bachmann : Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen , Vierteljahresschr -
W. Buchholz (1985)
Review: W. A. Howard, A System of Abstract Constructive OrdinalsJournal of Symbolic Logic, 50
-
(1998)
Bridge Kister : Natural wellorderings -
(1950)
Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen -
J. Crossley, Janelle Kister (1987)
Natural well-orderingsArchiv für mathematische Logik und Grundlagenforschung, 26
-
O. Veblen (1908)
Continuous increasing functions of finite and transfinite ordinalsTransactions of the American Mathematical Society, 9
-
D. Leivant, N. Danner (1999)
Ordinal notations in typed lambda-calculi -
K. Schütte (1954)
Kennzeichnung von Ordnungszahlen durch rekursiv erklärte FunktionenMathematische Annalen, 127
-
S. Feferman (1970)
Hereditarily Replete Functionals Over the OrdinalsStudies in logic and the foundations of mathematics, 60
-
(1950)
Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen, Vierteljahresschr -
S. Fortune, D. Leivant, Michael O'Donnell (1983)
The Expressiveness of Simple and Second-Order Type StructuresJ. ACM, 30
-
(1989)
Proof Theory, Springer L.N.M 1407 -
G. Takeuti (1975)
Proof Theory -
W. Buchholz, K. Schütte (1988)
Proof Theory of Impredicative Subsystems of Analysis -
M. Rathjen, A. Weiermann (1993)
Proof-Theoretic Investigations on Kruskal's TheoremAnn. Pure Appl. Log., 60
-
P. Aczel (1972)
Describing ordinals using functionals of transfinite typeJournal of Symbolic Logic, 37
-
W. Howard (1972)
A system of abstract constructive ordinalsJournal of Symbolic Logic, 37
-
(1999)
Leivant : Stratified polymorphism and primitive recursion -
(1975)
Relations between some hierarchies of ordinal functions and functionals, Dissertation, Stanford University -
Derivatives for ordinal functions and the Schütte brackets -
N. Danner (1999)
Ordinals and Ordinal Functions Representable in the Simply Typed lambda CalculusAnn. Pure Appl. Log., 97
-
W. Pohlers (1991)
Proof theory and ordinal analysisArchive for Mathematical Logic, 30
-
(1975)
Relations between some hierarchies of ordinal functions and functionals , Dissertation -
(1989)
Pohlers : Proof theory and ordinal analysis -
N. Danner, D. Leivant (1999)
Stratified polymorphism and primitive recursionMathematical Structures in Computer Science, 9
-
(1991)
Weiermann : Prooftheoretic investigations on Kruskal ’ s theorem
- Publisher
- Springer Journals
- Copyright
- Copyright © 2003 by Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-003-0177-z
- Publisher site
- See Article on Publisher Site
Abstract
The standard method of generating countable ordinals from uncountable ordinals can be replaced by a use of fixed point extractors available in the term calculus of Howard’s system. This gives a notion of the intrinsic complexity of an ordinal analogous to the intrinsic complexity of a function described in Gödel’s T.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Aug 6, 2003