Actual arithmetic and feasibility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2142, Issue , 2001, Pages 115-129

  Marion, Jean Yves ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

CUT ELIMINATION; FIRST ORDER; FUNCTIONAL PROGRAMS; PEANO ARITHMETIC; POLYNOMIAL-TIME;

COMPUTER CIRCUITS;

EID: 0005410906     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_9     Document Type: Conference Paper

References (28)

1. A. Asperti. Light affine logic. In Thirteenth Annual IEEE Symposium on Logic in Computer Science(LICS’98), pages 300–308, 1998.
2. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
3. S. Bellantoni and M. Hofmann. A new”feasible” arithmetic. Journal of symbolic logic, 2000. to appear.
4. R. Benzinger. Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University, 1999.
5. S. Buss. Bounded arithmetic. Bibliopolis, 1986.
6. N. Çaǧman, G. Ostrin, and S. Wainer. Proof theoretic complexity of low subrecursive classes. In F. L. Bauer and R. Steinbrueggen, editors, Foundations of Secure Computation, Foundations of Secure Computation, pages 249–286. IOS Press Amsterdam, 2000.
7. N. Dershowitz and J-P Jouannaud. Handbook of Theoretical Computer Science vol.B, Chapter Rewrite systems, pages 243–320. Elsevier Science Publishers B. V. (North-Holland), 1990.
8. J.-Y. Girard. Light linear logic. Information and Computation, 143(2):175–204, 1998. présenté à LCC’94, LNCS 960.
9. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge tracts in theoretical computer science. Cambridge university press, 1989.
10. A. Heyting. Die formalen regeln der intuitionischen logik. Sitzungsberichte der preussischen akademie von wissenschaften, pages 57–71, 1930.
11. P. Scott J.-Y. Girard, A. Scedrov. A modular approach to polynomial-time computability. Theoretical Computer Science, 97(1):1–66, 1992.
12. N. Jones. LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science, 228:151–174, 1999.
13. J.-L. Krivine. Lambda-calcul Masson, 1990. English translation by R. Cori: Lambda-Calculus, Types and Models (Ellis Horwood Series) 1993.
14. J.L. Krivine and M. Parigot. Programming with proofs. In SCT’87, pages 145–159, 1987.
15. D. Leivant. Reasoning about functional programs and complexity classes associated with type disciplines. In Twenty Fourth Symposium on Foundations of Computer Science, pages 460–469, 1983.
16. D. Leivant. Contracting proofs to programs. In P. Odifreddi, editor, Logic and Computer Science, pages 279–327. Academic Press, London, 1990.
17. D. Leivant. A foundational delineation of computational feasiblity. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS’91), 1991.
18. D. Leivant. Intrinsic theories and computational complexity. In Logical and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 177–194. Springer, 1994.
19. D. Leivant. Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, pages 320–343. Birkhäuser, 1994.
20. D. Leivant. Intrinsic reasoning about functional programs I: first order theories. Annals of Pure and Applied Logic, 2000. to appear.
21. D. Leivant. Termination proofs and complexity certification. In Proceedings of the third international workshop on Implicit Computational Complexity, 2001.
22. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
23. M. Parigot. Recursive programming with proofs. Theoretical Computer Science, 94:335–356, 1992.
24. D. Prawitz. Natural Deduction. Almqvist and Wiskel, Uppsala, 1965.
25. L. Roversi. A P-Time completeness proof for light logics. In Computer Science Logic, 13th International Workshop, CSL’99, volume 1683 of Lecture Notes in Computer Science, pages 469–483, 1999.
26. H. Schwichtenberg. Feasible programs from proofs. http://www.mathematik.unimuenchen. de/∼schwicht/.
27. H. Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27:177–188, 1988.
28. H. Weyl. Über die neue grundlagenkrise der mathematik. Mathematische zeitschrift, 1921.