A Proof of the Standardization Theorem in $\lambda$-Calculus (Towards new interaction between category theory and proof theory)
スポンサーリンク
概要
著者
関連論文
- A Proof-Theoretical Study on Logics with Constructible Falsity (Sequent Calculi and Proof Theory)
- Resource Bounded Unprovability of Computational Lower Bounds (Part 1) (Algebraic Aspects of Coding Theory and Cryptography)
- 到達可能関係の推移閉包を扱う様相論理のカノニカルモデルについて (形式体系と計算理論)
- Fragments of Second Order Propositional Logic (Proof theoretical study of the structure of logic and computation)
- 中間述語論理 CD について(算術体系の証明論)
- A Proof of the Standardization Theorem in $\lambda$-Calculus (Towards new interaction between category theory and proof theory)
- Contraction-Elimination Theorem
- Cut-free systems for some tense logics