How to assign ordinal numbers to combinatory terms with polymorphic types
From MaRDI portal
Publication:453195
DOI10.1007/s00153-012-0277-8zbMath1267.03035MaRDI QIDQ453195
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
proof theory; second-order logic; ordinal analysis; combinatory logic; primitive recursive functionals; Gödel's T
Related Items
Uses Software
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
- Typed Lambda Calculi and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item