Looking from the inside and from the outside

Synthese

Volumn 125, Issue 3, 2000, Pages 385-416

  Carbone, A ^a   Semmes, S ^b  

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

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000625726     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1023/A:1005244027724     Document Type: Article

References (51)

1. Ahlfors, L.: 1973, Conformal Invariants: Topics in Geometric Function Theory, McGraw-Hill, New York.
2. Ahlfors, L. and L. Sario: 1960, Riemann Surfaces, Princeton University Press, Princeton.
3. Bott, R. and L. Tu: 1982, Differential Forms in Algebraic Topology, Springer-Verlag, Berlin.
4. Buss, S.: 1987, 'Polynomial Size Proofs of the Propositional Pigeonhole Principle', Journal of Symbolic Logic 52, 916-27.
5. Buss, S.: 1991, 'The Undecidability of k-Provability', Annals of Pure and Applied Logic 53, 75-102.
6. Carbone, A.: 1997, 'Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus', Annals of Pure and Applied Logic 83, 249-99.
7. Carbone, A.: 2000a, 'Cycling in Proofs and Feasibility', Transactions of the American Mathematical Society 352, 2049-2075.
8. Carbone, A.: 2000b, 'Some Combinatorics behind Proofs', (submitted).
9. Carbone, A.: 2000c, 'Asymptotic Cyclic Expansion and Bridge Groups of Formal Proofs', (submitted).
10. Carbone, A. and S. Semmes: 1997, 'Making Proofs Without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination', Bulletin of the American Mathematical Society 34, 131-59.
11. Carbone, A. and S. Semmes: 1999, 'Prepositional Proofs via Combinatorial Geometry and the Search for Symmetry', in Collegium Logicum, Annals of the Kurt-Gödel-Society, Volume 3, pp. 85-98, Institute for Computer Science AS CR, Prague.
12. Carbone, A. and S. Semmes: 2000, A Graphic Apology for Symmetry and Implicitness - Combinatorial Complexity of Proofs, Languages, and Geometric Constructions, forthcoming, Oxford University Press, Oxford.
13. Chaitin, G.: 1987, Information, Randomness & Incompleteness - Papers on Algorithmic Information Theory, World Scientific, Singapore.
14. Chaitin, G.: 1992, Information-Theoretic Incompleteness, World Scientific, Singapore.
15. Connes, A.: 1994, Noncommutative Geometry, Academic Press, New York.
16. Cook, S. and R. Reckhow: 1979, 'The Relative Efficiency of Propositional Proof Systems', Journal of Symbolic Logic 44, 36-50.
17. Craig, W.: 1957, 'Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory', Journal of Symbolic Logic 22, 269-85.
18. Epstein, D., J. Cannon, D. Holt, M. Paterson, and W. Thurston: 1992, Word Processing in Groups, Jones and Bartlett, Boston.
19. Garey, M. and D. Johnson: 1979, Computers and Intractability : A Guide to the Theory of NP-Completeness, W. H. Freeman, New York.
20. Gentzen, G.: 1934, 'Untersuchungen über das Logische Schließen I-II', Mathematische Zeitschrift 39, 176-210, 405-31.
21. Gentzen, G.: 1969, in M. Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam.
22. Girard, J.-Y.: 1987a, 'Linear Logic', Theoretical Computer Science 50, 1-102.
23. Girard, J.-Y.: 1987b, Proof Theory and Logical Complexity, Bibliopolis, Napoli.
24. Girard, J.-Y.: 1989a, 'Towards a Geometry of Interaction', in J. Gray and A. Scedrov (eds), Categories in Computer Science and Logic, American Mathematical Society, Providence, pp. 69-108.
25. Girard, J.-Y.: 1989b, 'Geometry of Interaction I: Interpretation of System F', in R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo (eds), Logic Colloquium '88, North Holland, Amsterdam, pp. 221-60.
26. Girard, J.-Y.: 1990, 'Geometry of Interaction II: Deadlock-Free Algorithms', in P. Martin-Löf and G. Mints (eds), COLOG-88, Springer-Verlag, Berlin, pp. 76-93.
27. Girard, J.-Y: 1995, 'Geometry of Interaction III: Accommodating the Additives', in J.-Y. Girard, Y. Lafont, and L. Regnier (eds), Advances in Linear Logic, Cambridge University Press, Cambridge, pp. 329-89.
28. Gromov, M.: 1993, 'Asymptotic Invariants of Infinite Groups', in G. Niblo and M. Roller (eds), Geometric Group Theory, Volume 2, Cambridge University Press, Cambridge, pp. 1-295.
29. Haken, A.: 1985, 'The Intractability of Resolution', Theoretical Computer Science 39, 297-308.
30. Halmos, P.: 1974, Lectures on Boolean Algebras, Springer-Verlag, Berlin.
31. Johnson, D.: 1990, 'A Catalog of Complexity Classes', in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, Elsevier and MIT Press, Amsterdam and Cambridge, MA, pp. 67-161.
32. Kirwan, F.: 1992, Complex Algebraic Curves, Cambridge University Press, Cambridge.
33. Kolmogorov, A.: 1968, 'Logical Basis for Information Theory and Probability Theory', IEEE Transactions on Information Theory 14(5), 662-64.
34. Lang, S.: 1987, Elliptic Functions, Springer-Verlag, Berlin.
35. Li, M. and P. Vitányi: 1990, 'Kolmogorov Complexity and its Applications', in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, Elsevier and MIT Press, Amsterdam and Cambridge, MA, pp. 187-254.
36. Massey, W.: 1991, A Basic Course in Algebraic Topology, Springer-Verlag, Berlin.
37. Orevkov, V: 1982, 'Lower Bounds for Increasing Complexity of Derivations after Cut Elimination', Journal of Soviet Mathematics 20, 2337-350.
38. Orevkov, V.: 1993, in A. Bochman (trans.), D. Louvish (ed.), Complexity of Proofs and Their Transformations in Axiomatic Theories, American Mathematical Society, Providence.
39. Parikh, R.: 1971, 'Existence and Feasibility in Arithmetic', Journal of Symbolic Logic 36, 494-508.
40. Robinson, J.: 1949, 'Definability and Decision Problems in Arithmetic', Journal of Symbolic Logic 14, 98-114.
41. Rudin, W.: 1991, Functional Analysis, McGraw-Hill, New York.
42. Serre, J.-P.: 1951, 'Homologie Singulière des Espaces Fibrés', Annals of Mathematics 54, 425-505.
43. Simmons, G.: 1963, Introduction to Topology and Modern Analysis, McGraw-Hill, New York.
44. Statman, R.: 1974, Structural Complexity of Proofs, doctoral dissertation, Stanford University.
45. Statman, R.: 1978, 'Bounds for Proof-Search and Speed-Up in the Predicate Calculus', Annals of Mathematical Logic 15, 225-87.
46. Statman, R.: 1979, 'Lower bounds on Herbrand's Theorem', Proceedings of the American Mathematical Society 75, 104-7.
47. Stein, E.: 1970, Singular Integrals and Differentiability Properties of Functions, Princeton University Press, Princeton.
48. Takeuti, G.: 1975, Proof Theory, North-Holland, Amsterdam.
49. Tseitin, G.: 1968, 'Complexity of a Derivation in the Prepositional Calculus', Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR 8, 234-59.
50. Urquhart, A.: 1987, 'Hard Examples for Resolution', Journal of the Association for Computing Machinery 34, 209-19.
51. van Leeuwen, J. (ed.): 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Elsevier and MIT Press, Amsterdam and Cambridge, MA.