Typing in reflective combinatory logic

DOI10.1016/j.apal.2005.11.004zbMath1103.03016OpenAlexW2090169043MaRDI QIDQ2498910

Nikolai Krupski

Publication date: 16 August 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.11.004

zbMATH Keywords

derivabilityproof theorytypingwell-formed formulacomplexity, cut eliminationreflective combinatory logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Sequent Calculus for Intuitionistic Epistemic Logic IEL ⋮ The basic intuitionistic logic of proofs

Cites Work

• Intuitionistic propositional logic is polynomial-space complete
• Explicit Provability and Constructive Semantics
• Alternation
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Typing in reflective combinatory logic