Cycling in proofs and feasibility

Transactions of the American Mathematical Society

Volumn 352, Issue 5, 2000, Pages 2049-2075

  Carbone, A ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Complexity of proofs; Cut elimination; Cycles in proofs; Feasible numbers; Structure of proofs

Indexed keywords

EID: 23044521034     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0002-9947-99-02300-4     Document Type: Article

References (34)

1. P. Bernays. Sur le platonisme dans les mathématiques. L'Enseignement Mathématique, 34:5269, 1935.
2. G. Boolos. Don't eliminate cut. Journal o/ Philosophical Logic, 13:373-378, 1984. MR 851:03029
3. S. Buss. The undecidability of fc-provability. Annals of Pure and Applied Logic, 53:72-102, 1991. MR 92g:03071
4. A. Carbone. On Logical Flow Graphs. Ph.D. Dissertation, Graduate School of The City University of New York, May 1993.
5. A. Carbone. Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus. In Annals of Pure and Applied Logic, 83:249-299, 1997. MR 98i:03073
6. A. Carbone. Turning cycles into spirals. Annals of Pure and Applied Logic, 96:57-73, 1997.
7. A. Carbone. Proofs and Groups with distorted Length Function. Manuscript, 1996.
8. A. Carbone and S. Sommes. Looking from the inside and from the outside. I.H.E.S. preprint M/96/44, 1996 (Bures-sur-Yvette, France).
9. A. Carbone and S. Sommes. Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination. In Bulletin of the American Mathematical Society, 34:131-159, 1997. MR 98c:03112
10. A. Carbone and S. Semmes. Geometry, Symmetry and Implicit Representations of Combinatorial Structures. Book in preparation, 1997.
11. A.G. Dragalin. Correctness of inconsistent theories with notion of feasibility. In LNCS 208, pages 58-79. Springer Verlag, 1985. MR 87e:03150
12. M.E. Dummett. Wang's paradox. In Truth and Other Enigmas, pages 248-268. Harvard University Press, Cambridge, 1978. Also appeared in Synthèse 30:301-324, 1975.
13. M.E. Dummett. Wittgenstein's philosophy of mathematics. In Truth and Other Enigmas, pages 166-185. Harvard University Press, Cambridge, 1978. Also appeared in The Philosophical Review, Cornell University, 1959.
14. A.S. Esenin-Volpin. Le programme ultra-intuitionniste des fondements des mathématiques. In Infinitistic Methods, Proceedings of the Symposium on the Foundations of Mathematics, pages 201-223. PWN. Warsaw, 1961. MR 26:4905
15. A.S. Esenin-Volpin. The ultra-intuitionistic criticism and the antitraditional program for foundations of mathematics. In A. Kino, J. Myhill, and R.E. Vcsley, editors, Intuitionism and Proof Theory, pages 3-45. North-Holland, 1970. MR 45:4938
16. R.O. Gandy. Limitation to mathematical knowledge. In D. van Dalen, D. Lascar, and J. Smiley, editors, Logic Colloquium 80, pages 129-146. North-Holland Publishing Company, 1982. MR 84d:00010
17. J.Y. Girard. Proof Theory and Logical Complexity, volume 1 of Studies in Proof .Theory, Monographs. Bibliopolis, 1987. MR 89a:03113
18. J.Y. Girard. Linear Logic. Theoretical Computer Science, 50:1-102, 1987. MR 89m:03057
19. S.C. Klcene. Introduction to Metamathematics, volume 1 of Bibliotheca Mathematica, Monographs on Pure and Applied Mathematics. Groningen, Walters-Noordhoff, 1988.
20. G. Kreisel. Axiomatizations of nonstandard analysis that are conservative extensions of formal systems for classical standard analysis. In Application of Model Theory, W.A.J. Luxemburg, editor, pages 93-106. Holt, Rinehart and Winston, New York, 1969. MR 39:50
21. G. Mannoury. Methodologisches und Philosophisches zur Elementar-Mathematik. Visser, Haarlem, 1909.
22. E. Nelson. Predicative Arithmetic. Princeton University Press, Princeton, New Jersey, 1986. MR 88c:03061
23. R. Parikh. A conservation result. In W.A.J. Luxemburg, editor, Application of Model Theory, pages 107-108. Holt, Rinehart and Winston, New York, 1969. MR 38:3145
24. V. P. Orevkov. Lower Bounds for increasing complexity of derivations after cut elimination. Journal of Soviet Mathematics, 20(4), 1982.
25. R. Parikh. Existence and feasibility in arithmetic. Journal of Symbolic Logic, 36:494-508, 1971. MR 46:3287
26. R. Parikh. The problem of vague predicates. In Language, Logic and Method, R.S. Cohen and M.W. Wartofsky, editors, pages 241-261. 1983.
27. H. Poincaré. The Foundations of Science. Science Press, 1913.
28. V.Yu. Sazonov. On feasible numbers. In Proceedings of The Kleene's Conference on Mathematical Logic, Varna, 1990.
29. R. Statman. Bounds Tor proof-search and speed-up in predicate calculus. In Annals of Mathematical Logic, 15:225-287. 1978. MR 81c:03049
30. G. Takeuti. Proof Theory, volume 81 of Studies in Logic and the Foundations of Mathematics. North Holland, 1975. MR 58:27366a
31. A.S. Troelstra. Remarks on intuitionism and the philosophy of mathematics (revised version). In Proceedings of the Congresso Internazionale "Nuovi Problemi delta Logica e delta Filosofia della Scienza", Viareggio 8-13 January, 1990.
32. G.S. Tseitin. The complexity of a deduction in the prepositional predicate calculus. In Zap. Nauchn. Sem. Leningrad Old. Mat. Inst. Akad. Nauk SSSR, 8:234-259. 1968. MR 43:6098
33. P. Vopenka. Mathematics in the Alternative Set Theory. Teubner, Leipzig, 1979. MR 83f:03051
34. L. Wittgenstein. In Remarks on the Foundations of Mathematics. R. Rhees, G.H. von Wright and G.B.M. Anscombe, editors, The MIT Press, Cambridge, 1978. Revised Version. MR 80f:00009