A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
暂无分享,去创建一个
[1] Wim Veldman. An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic , 1976, J. Symb. Log..
[2] Kurt Schutte. Syntactical and Semantical Properties of Simple Type Theory , 1960 .
[3] Georg Kreisel,et al. A remark on free choice sequences and the topological completeness proofs , 1958, Journal of Symbolic Logic.
[4] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[5] Georg Kreisel,et al. On weak completeness of intuitionistic predicate logic , 1962, Journal of Symbolic Logic.
[6] John C. Mitchell,et al. Foundations for programming languages , 1996, Foundation of computing series.
[7] J. Girard. Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .
[8] Dag Prawitz. Hauptsatz for Higher Order Logic , 1968, J. Symb. Log..
[9] Moto-O. Takahashi,et al. A proof of cut-elimination theorem in simple type-theory , 1967 .
[10] K. Schutte. Review: Dag Prawitz, Hauptsatz for Higher Order Logic; Dag Prawitz, Completeness and Hauptsatz for Second Order Logic; Moto-o Takahashi, A Proof of Cut-Elimination in Simple Type-Theory , 1974 .
[11] D. van Dalen,et al. Lectures on intuitionism , 1973 .
[12] James Lipton,et al. Completeness and Cut-elimination in the Intuitionistic Theory of Types , 2005, J. Log. Comput..
[13] Harrie C. M. de Swart. Another Intuitionistic Completeness Proof , 1976, J. Symb. Log..
[14] Gilles Dowek,et al. Proof normalization modulo , 1998, Journal of Symbolic Logic.
[15] Mitsuhiro Okada. Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic , 1999, Theor. Comput. Sci..
[16] J. Girard,et al. Proofs and types , 1989 .
[17] Claude Kirchner,et al. Theorem Proving Modulo , 2003, Journal of Automated Reasoning.
[18] Peter B. Andrews. Resolution in type theory , 1971, Journal of Symbolic Logic.
[19] Mitsuhiro Okada,et al. A uniform semantic proof for cut-elimination and completeness of various first and higher order logics , 2002, Theor. Comput. Sci..
[20] H. Friedman. Equality between functionals , 1975 .
[21] A. Troelstra,et al. Constructivism in Mathematics: An Introduction , 1988 .
[22] W. W. Tait,et al. A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic , 1966 .
[23] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.