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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,105

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

Reduction of higher type levels by means of an ordinal analysis of finite terms.Jan Terlouw - 1985 - Annals of Pure and Applied Logic 28 (1):73-102.
TERLOUW, J., Reduction of higher type levels by means of an ordinal analysis of finite terms WOOD, C., see SARACINO, D.D. Saracino - 1985 - Annals of Pure and Applied Logic 28 (1):322.
Functors and Ordinal Notations. IV: The Howard Ordinal and the Functor $\wedge$??Jacqueline Vauzeilles - 1985 - Journal of Symbolic Logic 50 (2):331-338.
W. W. Tait. Intensional interpretations of functionals of finite type I. The journal of symbolic logic, vol. 32 , pp. 198–212. [REVIEW]J. Y. Girard - 1975 - Journal of Symbolic Logic 40 (4):624-625.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
Review: W. Pohlers, Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for $ID_1$; W. Pohlers, Cut Elimination for Impredicative Infinitary Systems. Part II. Ordinal Analysis for Iterated Inductive Definitions. [REVIEW]Kurt Schutte - 1983 - Journal of Symbolic Logic 48 (3):879-880.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
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
49 (#429,125)

6 months
10 (#360,910)

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.
Representing definable functions of HA by neighbourhood functions.Tatsuji Kawai - 2019 - Annals of Pure and Applied Logic 170 (8):891-909.

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