Interpolants, cut elimination and flow graphs for the prepositional calculus

Annals of Pure and Applied Logic

Volumn 83, Issue 3, 1997, Pages 249-299

  Carbone, A ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031566906     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(96)00019-X     Document Type: Article

References (23)

1. [1] R.B. Boppana and M. Sipser, The complexity of finite functions, in: Jan Van Leeuwen, ed., The Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (Elsevier/MIT Press, Amsterdam/Cambridge, 1990).
2. [2] S. Buss, The undecidability of k-provability, Ann. Pure Appl. Logic 53 (1991) 72-102.
3. [3] A. Carbone, On logical flow graphs, Ph.D. Dissertation, Graduate School, The City Univ. of New York, May 1993.
4. [4] A. Carbone, The Craig interpolation theorem for schematic systems, in: Collegium Logicum, Annals of the Kurt Gödel Society, Vol. 2 (Springer, Berlin, 1996).
5. [5] S.A. Cook and R. Reckhow, The relative efficiency of propositional proof systems, J. Symbolic Logic 44 (1979) 36-50.
6. [6] W.M. Farmer, A unification-theoretic method for investigating the k-provability problem, Ann. Pure Appl. Logic 51 (1991) 173-214.
7. [7] J.Y. Girard, Proof theory and logical complexity, in: Studies in Proof Theory, Monographs, Vol. 1 (Bibliopolis, Naples, 1987).
8. [8] J.Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
9. [9] M. Gromov, Cell division and hyperbolic geometry, Publication of IHES/M/90/54, Institut des Hautes Etudes Scientifiques, Bures-sur-Yvette, June 1990.
10. [10] S.C. Kleene, Introduction to Metamathematics, Bibliotheca Mathematica, Monographs on Pure and Applied Mathematics, Vol. 1 (Groningen, Walters-Noordhoff, 1988).
11. [11] J. Krajíček and P. Pudlák, The number of proof lines and the size of proofs in first order logic, Arch. Math. Logic 27 (1988) 69-84.
12. [12] V.M. Krapchenko, Complexity of the realization of a linear function in the class of Π-circuits, Mat. Zamet. 9 (1971) 35-40. English translation in Math. Notes Acad. Sci. USSR 10 (1971) 21-23.
13. [12] V.M. Krapchenko, Complexity of the realization of a linear function in the class of Π-circuits, Mat. Zamet. 9 (1971) 35-40. English translation in Math. Notes Acad. Sci. USSR 10 (1971) 21-23.
14. [13] V.M. Krapchenko, A method of obtaining lower bounds for the complexity of Π-schemes, Mat. Zametki, 10 (1971) 83-92. English translation in Math. Notes Acad. Sci. USSR 11 (1972) 474-479.
15. [13] V.M. Krapchenko, A method of obtaining lower bounds for the complexity of Π-schemes, Mat. Zametki, 10 (1971) 83-92. English translation in Math. Notes Acad. Sci. USSR 11 (1972) 474-479.
16. [14] A.R. Meyer, A note on the length of Craig's interpolants, Technical report, Laboratory for Computer Science, M.I.T., October 1980.
17. [15] D. Mundici, NP and Craig's interpolation theorem. in: G. Longo, G. Lolli and A. Marcja, eds., Logic Colloquium '82 (Elsevier, Amsterdam, 1984).
18. [16] D. Mundici, A quadratic lower bound for the complexity of boolean interpolants. Technical report, Dept. of Computer Science, Univ. of Milan, 1993.
19. [17] R. Parikh, Some results on the length of proofs, Trans. Amer. Math. Soc. 177 (1973) 29-36.
20. [18] P. Pudlák, The length of proofs, in: S. Buss, ed., Handbook of Proof Theory (North-Holland, Amsterdam, 1995).
21. [19] G. Takeuti, Proof theory, in: Studies in Logic and the Foundations of Mathematics, Vol. 81 (North-Holland, Amsterdam, 1975).
22. [20] A. Urquhart, Complexity of proofs in classical propositional logic, in: Y.N. Moschovakis, ed., Logic from Computer Science (Springer, Berlin, 1992) 597-608.
23. [21] S. Wolfram, Cellular Automata and Complexity, collected papers (Addison-Wesley, Reading, MA, 1994).