How to assign ordinal numbers to combinatory terms with polymorphic types
type: Item
instance of: scholarly article
title: How to assign ordinal numbers to combinatory terms with polymorphic types
zbMATH Open document ID: 1267.03035
author: William R. Stirton
published in: Archive for Mathematical Logic
publication date: 2012-09-18T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03F10
zbMATH DE Number: 6083826
zbMATH Keywords: proof theory
zbMATH Keywords: combinatory logic
zbMATH Keywords: primitive recursive functionals
zbMATH Keywords: Gödel's T
zbMATH Keywords: ordinal analysis
zbMATH Keywords: second-order logic
describes a project that uses: Automath
MaRDI profile type: Publication
full work available at URL: s00153-012-0277-8
OpenAlex ID: W2074018571
cites work: Q2778814
cites work: Q4934555
cites work: Analyzing Gödel's T Via Expanded Head Reduction Trees
cites work: Typed Lambda Calculi and Applications
cites work: Combinatory logic. With two sections by William Craig.
cites work: Combinatory logic. Vol. II
cites work: Q5591512
cites work: Q5606582
cites work: Ordinal analysis of terms of finite type
cites work: Q3912575
cites work: Q4428884
cites work: Q3325707
cites work: Q4143279
cites work: On the fundamental conjecture of \(GLC\). I, II
cites work: On the fundamental conjecture of \(GLC\). V
cites work: Proof theory. 2nd ed
cites work: On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
cites work: Q4499084
DOI: 10.1007/S00153-012-0277-8
description: scientific article; zbMATH DE number 6083826