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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,549

External links

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

Through your library

Similar books and articles

The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.

Analytics

Added to PP
2009-01-28

Downloads
39 (#405,268)

6 months
22 (#158,855)

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