Ordinal analysis of terms of finite type

Journal of Symbolic Logic 45 (3):493-504 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273417

Links

PhilArchive



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

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

Ordinal analysis without proofs.Jeremy Avigad - manuscript
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Second-order characterizable cardinals and ordinals.Benjamin R. George - 2006 - Studia Logica 84 (3):425 - 449.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
Lascar Types and Lascar Automorphisms in Abstract Elementary Classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Notre Dame Journal of Formal Logic 52 (1):39-54.
Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.

Analytics

Added to PP
2009-01-28

Downloads
25 (#595,425)

6 months
8 (#283,518)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
An upper bound for reduction sequences in the typed λ-calculus.Helmut Schwichtenberg - 1991 - Archive for Mathematical Logic 30 (5-6):405-408.
Combinatory logic with polymorphic types.William R. Stirton - 2022 - Archive for Mathematical Logic 61 (3):317-343.
The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.

View all 8 citations / Add more citations

References found in this work

Functionals defined by recursion.Luis Elpidio Sanchis - 1967 - Notre Dame Journal of Formal Logic 8 (3):161-174.

Add more references