An arithmetic for polynomial-time computation

Theoretical Computer Science

Volumn 357, Issue 1-3, 2006, Pages 202-214

  Schwichtenberg, Helmut ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Linear Heyting arithmetic; Polynomial time; Ramification

Indexed keywords

COMPUTATION THEORY; LINEAR SYSTEMS; POLYNOMIALS; REQUIREMENTS ENGINEERING;

HEYTING ARITHMETIC; LINEAR HEYTING ARITHMETIC; POLYNOMIAL-TIME COMPUTATION; RAMIFICATION;

DIGITAL ARITHMETIC;

EID: 33745403239     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.03.019     Document Type: Article

References (26)

1. Aehlig K., Berger U., Hofmann M., and Schwichtenberg H. An arithmetic for non-size-increasing polynomial time computation. Theoret. Comput. Sci. 318 1-2 (2004) 3-27
2. Aehlig K., and Schwichtenberg H. A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Logic 3 3 (2002) 383-401
3. Bellantoni S., and Cook S. A new recursion-theoretic characterization of the polytime functions. Comput. Complexity 2 (1992) 97-110
4. Bellantoni S., and Hofmann M. A new "feasible" arithmetic. J. Symbolic Logic 67 1 (2002) 104-116
5. Bellantoni S., Niggl K.-H., and Schwichtenberg H. Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Logic 104 (2000) 17-30
6. Berger U. Program extraction from normalization proofs. In: Bezem M., and Groote J.F. (Eds). Typed Lambda Calculi and Applications, Lecture Notes in Computer Science Vol. 664 (1993), Springer, Berlin, Heidelberg, New York 91-106
7. S.R. Buss, Bounded arithmetic, Studies in Proof Theory, Lecture Notes, Bibliopolis, Napoli, 1986.
8. Clote P., and Takeuti G. Bounded arithmetic for NC, ALogTIME, L and NL. Ann. Pure Appl. Logic 56 (1992) 73-117
9. Cook S.A. Computability and complexity of higher type functions. In: Moschovakis Y.N. (Ed). Logic from Computer Science, Proceedings of a Workshop held from November 13-17, 1989, MSRI Publications Vol. 21 (1992), Springer, Berlin, Heidelberg, New York 51-72
10. S.A. Cook, B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: S. Buss, P. Scott (Eds.), Feasible Mathematics Birkhäuser, 1990, pp. 71-96.
11. Girard J.-Y. Light linear logic. Inform. and Comput. 143 (1998)
12. J.-Y. Girard, A. Scedrov, P.J. Scott, Bounded linear logic, in: S.R. Buss, Ph.J. Scott (Eds.), Feasible Mathematics Birkhäuser, Boston, 1990, pp. 195-209.
13. Gödel K. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts. Dialectica 12 (1958) 280-287
14. Hilbert D. Über das Unendliche. Math. Ann. 95 (1925) 161-190
15. M. Hofmann, Typed lambda calculi for polynomial-time computation, Habilitation Thesis, Mathematisches Institut, TU Darmstadt, Germany. Available under www.dcs.ed.ac.uk/home/mxh/habil.ps.gz, 1998.
16. M. Hofmann, Linear types and non-size-increasing polynomial time computation, in: Proc. 14th Symp. on Logic in Computer Science (LICS'99), 1999, pp. 464-473.
17. Leivant D. Intrinsic theories and computational complexity. In: Leivant D. (Ed). Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, IN, USA, October 1994, Lecture Notes in Computer Science Vol. 960 (1995), Springer, Berlin, Heidelberg, New York 177-194
18. Leivant D. Termination proofs and complexity certification. In: Pierce B.C., and Kobayashi N. (Eds). Proc. Fourth TACS, Heidelberg, Lecture Notes in Computer Science Vol. 2215 (2001), Springer, Berlin 183-200
19. D. Leivant, J.-Y. Marion, Lambda calculus characterization of poly-time, in: M. Bezem, J.F. Groote (Eds.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Vol. 664, 1993, pp. 274-288.
20. D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity IV: predicative functionals and poly-space, Inform. and Comput., to appear.
21. Marion J.-Y. Actual arithmetic and feasibility. In: Fribourg L. (Ed). Fifteenth Internat. Workshop, Computer Science Logic, CSL'01 Lecture Notes in Computer Science Vol. 2142 (2001), Springer, Berlin 115-139
22. Ostrin G., and Wainer S.S. Elementary arithmetic. Ann. Pure Appl. Logic 133 (2005) 275-292
23. Pfenning F. Computation and Deduction (2001), Cambridge University Press, Cambridge
24. Schwichtenberg H., and Bellantoni S. Feasible computation with higher types. In: Schwichtenberg H., and Steinbrüggen R. (Eds). Proof and System-Reliability, Proc. NATO Advanced Study Institute, Marktoberdorf, 2001 (2002), Kluwer Academic Publisher, Dordrecht 399-415
25. Simmons H. The realm of primitive recursion. Arch. Math. Logic 27 (1988) 177-188
26. A.S. Troelstra (Ed.), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, Vol. 344, Springer, Berlin, Heidelberg, New York, 1973.