A comparison of two systems of ordinal notations

Archive for Mathematical Logic 43 (1):65-83 (2004)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.1007/s00153-003-0177-z

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Fruitful and helpful ordinal functions.Harold Simmons - 2008 - Archive for Mathematical Logic 47 (7-8):677-709.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
Normal forms for elementary patterns.Timothy J. Carlson & Gunnar Wilken - 2012 - Journal of Symbolic Logic 77 (1):174-194.
Ordinal arithmetic and $\Sigma_{1}$ -elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams.Mitsuhiro Okada - 1987 - Journal of Symbolic Logic 52 (3):577-581.
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. [REVIEW]Andreas Weiermann - 1995 - Archive for Mathematical Logic 34 (5):313-330.
Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.

Analytics

Added to PP
2013-11-23

Downloads
33 (#459,370)

6 months
9 (#250,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Fruitful and helpful ordinal functions.Harold Simmons - 2008 - Archive for Mathematical Logic 47 (7-8):677-709.

Add more citations

References found in this work

Describing ordinals using functionals of transfinite type.Peter Aczel - 1972 - Journal of Symbolic Logic 37 (1):35-47.

Add more references