Interpolation theorems for intuitionistic predicate logic

Annals of Pure and Applied Logic - Tập 113 - Trang 225-242 - 2001
G. Mints1
1Department of Philosophy, Stanford University, Stanford, CA 94305, USA

Tài liệu tham khảo

Bittel, 1992, Vol. 633, 262

Craig, 1957, Linear reasoning, J. Symbolic Logic, 22, 250, 10.2307/2963593

Felty, 1991, A logic program for transforming sequent proofs to natural deduction proofs, Lecture Notes in Artif. Intell., 475, 157

Fitting, 1969

Kleene, 1952, Two Papers on the Predicate Calculus, Mem. Amer. Math. Soc., 10, 1

S.A. Kripke, Semantical Analysis of Intuitionistic Logic Vol. I, North-Holland, Amsterdam, 1965, pp. 92–130.

Maksimova, 1979, Interpolation properties of super-intuitionistic logics, Studia Logica, 38, 419, 10.1007/BF00370479

S. Maslov, An invertible sequent variant of the constructive predicate calculus Seminars in Mathematics, V.A. Steklov Mathematical Institute, Vol. 4, 1969, pp. 96–111.

G. Mints, Varying of proof-search tactics in sequenzen-calculi, Seminars in Mathematics, V.A. Steklov Mathematical Institute, Vol. 4 (1969) 52–69.

G. Mints, Analytic cut in modal logic (russian), Soviet Conference in Applied Logic (Novosibirsk) (1985) 141–142.

Mints, 1997, Indexed systems of sequents and cut-elimination, J. Philos. Logic, 26, 671, 10.1023/A:1017948105274

Schütte, 1968

Stone, 1999, Representing scope in intuitionistic deductions, Theoret. Comput. Sci., 211, 129, 10.1016/S0304-3975(98)00244-8

G. Takeuti, in: Proof Theory, Studies in Logic and the Foundations of Mathematics, Vol. 81, North-Holland, Amsterdam, 1975.

Thông tin
Thông tin xuất bản

Annals of Pure and Applied Logic

Tập 113

225-242

Thông tin tác giả