How to assign ordinal numbers to combinatory terms with polymorphic types

DOI10.1007/S00153-012-0277-8zbMath1267.03035OpenAlexW2074018571MaRDI QIDQ453195

William R. Stirton

Publication date: 18 September 2012

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-012-0277-8

zbMATH Keywords

proof theorysecond-order logicordinal analysiscombinatory logicprimitive recursive functionalsGödel's T

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Combinatory logic with polymorphic types ⋮ A decidable theory of type assignment

Uses Software

• Automath

Cites Work

• On the fundamental conjecture of \(GLC\). V
• Combinatory logic. With two sections by William Craig.
• On the fundamental conjecture of \(GLC\). I, II
• Proof theory. 2nd ed
• Combinatory logic. Vol. II
• Ordinal analysis of terms of finite type
• On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
• Analyzing Gödel's T Via Expanded Head Reduction Trees
• Typed Lambda Calculi and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to assign ordinal numbers to combinatory terms with polymorphic types