Asymptotic cyclic expansion and bridge groups of formal proofs

Journal of Algebra

Volumn 242, Issue 1, 2001, Pages 109-145

  Carbone, A ^a  

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

Author keywords

Formal proofs; logical flow graphs; cut elimination; bridge groups; Baumslag Solitar groups; Gersten groups

Indexed keywords

EID: 0035429699     PISSN: 00218693     EISSN: None     Source Type: Journal    
DOI: 10.1006/jabr.2000.8700     Document Type: Article

References (41)

1. Baaz M., Leitsch A. Cut normal forms and proof complexity. Ann. Pure Appl. Logic. 94:1998.
2. Baumslag G., Solitar D. Some two-generators one-relator non-Hopfian groups. Bull. Amer. Math. Soc. 68:1962;199-201.
3. Baumslag G. A survey on groups with a single defining relation. Robertson E. F., Campbell C. M. Proceedings of Groups - St. Andrews, 1985. London Math. Soc. Lecture Note Ser. 121:1986;30-58 Cambridge Univ. Press, Cambridge.
4. Boone W. W. Certain simple unsolvable problems of group theory I. Nederl. Akad. Wetensch. Indag. Math. 6:1954;231-237.
5. Buss S. R. The propositional pigeonhole principle has polynomial size frege proofs. J. Symbolic Logic. 52:1987;916-927.
6. Buss S. R. The undecidability of k-provability. Ann. Pure Appl. Logic. 53:1991;72-102.
7. Carbone A. Interpolants, cut elimination and flow graphs for the propositional calculus. Ann. Pure Appl. Logic. 83:1997;249-299.
8. Carbone A. Cycling in proofs and feasibility. Trans. Amer. Math. Soc. 5:2000;2049-2075.
9. Carbone A. Duplication of directed graphs and exponential blow up of proofs. Ann. Pure Appl. Logic. 100:1999;1-76.
10. A. Carbone, The cost of a cycle is a square, J. Symbolic Logic, in press.
11. Carbone A., Semmes S. Looking from the inside and the outside. Synthèse. 125:2000;385-412.
12. Carbone A., Semmes S. Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination. Bull. Amer. Math. Soc. 34:1997;131-159.
13. Carbone A., Semmes S. A Graphic Apology for Symmetry and Implicitness. Mathematical Monographs. 2000;Oxford Univ. Press, London.
14. Epstein D. B. A., Cannon J. W., Holt D. F., Levy S. V. F., Paterson M. S., Thurston W. P. Word Processing in Groups. 1992;Jones & Bartlett, Boston/London.
15. Furstenberg H., Weiss B. Topological dynamics and combinatorial number theory. J. Anal. Math. 34:1978;61-85.
16. Gentzen G. Untersuchungen über das logische Schließen, I, II. Math. Z. 39:1934;176-210.
17. 1-norms of finite representations. Baumslag, Miller. Algorithmic and Classification Problems. MSRI Series. 23:1990;Springer-Verlag, New York/Berlin.
18. Gersten S. Isoperimetric and isodiametric functions of finite presentations. Niblo, Roller. Geometric Group Theory. London Math. Soc. Lecture Note Ser. 1:1993;Cambridge Univ. Press, Cambridge.
19. Girard J. Y. Linear logic. Theoret. Comput. Sci. 50:1987;1-102.
20. Girard J. Y. Proof Theory and Logical Complexity. Studies in Proof Theory, Monographs. 1:1987;Bibliopolis, Napoli.
21. Girard J.-Y. Geometry of interaction. I. Interpretation of system F. Ferro. Logic Colloquium 1988. 1989;North-Holland, Amsterdam.
22. Girard J.-Y. Geometry of interaction. II. Deadlockfree algorithms. Löf P. M., Mints G. Proceedings of COLOG '88. Lecture Notes Comput. Sci. 417:1989;76-93 Springer-verlag, Berlin.
23. Girard J.-Y. Geometry of interaction. III. The general case. Girard J., Lafont Y., Regnier L. Proceedings, Workshop on Linear Logic, Cornell 1993, Advances in Linear Logic. London Math. Soc. Lecture Note Ser. 222:1995;Cambridge Univ. Press, Cambridge.
24. Goldfarb W. D. The undecidability of the second-order unification problem. Theoret. Comput. Sci. 13:1981;225-230.
25. Gromov M. Asymptotic invariants of infinite groups. Niblo, Roller. Geometric Group Theory. London Math. Soc. Lecture Note Ser. 2:1993;Cambridge Univ. Press, Cambridge.
26. Haken A. The intractability of resolution. Theoret. Comput. Sci. 39:1985;297-308.
27. Krajiček J., Pudlák P. The number of proof lines and the size of proofs in first order logic. Arch. Math. Logic. 27:1988;69-84.
28. Lyndon R. C., Schupp P. E. Combinatorial Group Theory. 1977;Springer-Verlag, New York/Berlin.
29. Milnor J. A note on curvature and fundamental group. J. Differential Geom. 2:1968;1-7.
30. Novikov P. S. Unsolvability for the conjugacy problem in the theory of groups. Izv. Akad. Nauk SSSR Ser. Mat. 18:1954;485-525.
31. A. Yu. Ol'shanskii, and, M. V. Sapir, Length and area functions on groups and quasi-isometric Higman embeddings, preprint, http://atlas.math.vanderbilt.edu/m̃sapir , 1999.
32. Orevkov V. P. Lower bounds for increasing complexity of derivations after cut elimination. J. Soviet Math. 20:1982.
33. Orevkov V. P. Complexity of Proofs and Their Transformations in Axiomatic Theories. Translations of Mathematical Monographs. 128:1993;Amer. Math. Soc. Providence.
34. Parikh R. Existence and feasibility in arithmetic. J. Symbolic Logic. 36:1971;494-508.
35. Sapir M. V., Birget J. C., Rips E. Isoperimetric and isodiametric functions of groups. Internat. J. Algebra Comput. 1999.
36. Schwartz A. A volume invariant of coverings. Dokl. Akad. Nauk SSSR. 105:1995;32-34.
37. Statman R. Bounds for proof-search and speed-up in predicate calculus. Ann. Math. Logic. 15:1978;225-287.
38. Statman R. Lower bounds on Herbrand's Theorem. Proc. Amer. Math. Soc. 75:1979;104-107.
39. Takeuti G. Proof Theory. Studies in Logic. 81:1987;North-Holland, Amsterdam.
40. Tseitin G. S. Complexity of a derivation in the propositional calculus. Zap. Nauchn. Sem. Leningrad Otdel. Mat. Inst. Akad. Nauk SSSR. 8:1968;234-259.
41. Van der Waerden B. L. Beweis einer baudetschen vermutung. Nieuw Arch. Wisk. 1927;212-216.