Polytime, combinatory logic and positive safe induction

Archive for Mathematical Logic

Volumn 41, Issue 2, 2002, Pages 169-189

  Cántini, Andrea ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Combinatory logic; Polytime; Safe induction

Indexed keywords

EID: 0036488435     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530100105     Document Type: Article

References (19)

1. [B84] Barendregt, H.: The Lambda Calculus: its Syntax and Semantics, North Holland, Amsterdam (1984)
2. [BL92] Bellantoni, S.: Predicative Recursion and Computational Complexity, Ph.D. Thesis, University of Toronto, (1992)
3. [BLHOF00] Bellantoni, S., Hoffman, M.: A new "feasible" arithmetic, Journal of Symbolic Logic, to appear (see http://www.dcs.ed.ac.uk/home/mxh/sjb.ps)
4. [BNS99] Bellantoni, S., Niggl, K.H., Schwichtenberg, H.: Ramification, Modality and linearity in higher types, Annals of Pure and Applied Logic, 104, 17-30 (2000)
5. [C99] Cantini, A.: Characterizing feasible functions within an intuitionistic theory of operations based on combinatory logic and safe induction, pp. 1-14, preprint (talk presented at the Research Workshop on Proof Theory, Leeds, Feb. 11-13, 1999)
6. [C00] Cantini, A.: Feasible Operations and Applicative Theories Based on λη, Mathematical Logic Quarterly, 46, 291-312 (2000)
7. [HOF98] Hofmann, M.: A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, Proceedings of of CSL'97, Aarhus, Springer, Springer, Lecture Notes in Computer Science, 1414, 275-294 (1998)
8. [HOF00] Hofman, M.: Safe recursion with higher types and BCK-algebra, Annals of Pure and Applied Logic, 104, 113-166 (2000)
9. [HOF97] Hofman, M.: An application of category theoretic-semantics to the characterisation of complexity classes using higher-order complexity function algebras, Bulletin of Symbolic Logic, 3(4), 469-486 (1997)
10. [GI98] Girard, J.Y.: Light Linear Logic, Information and Computation, 204, 143-175 (1998)
11. [L94] Leivant, D.: A foundational delineation of polytime, Information and Computation, 110, 391-420 (1994)
12. [L95] Leivant, D.: Ramified recurrence and computational complexity I: word recurrence and polytime, In: P. Clote and J.Remmel (eds.), Feasible Mathematics II, Birkäuser, Basel 1995, pp. 320-343
13. [L95a] Leivant, D.: Intrinsic Theories and Computational Complexity, In: D. Leivant (ed.), Logic and Computational Complexity, Lecture Notes in Computer Science, 960, 177-194 (1995)
14. [SCHL95] Schlüter A.: An extension of Leivant's characterization of polytime by predicative arithmetic, preprint, pp. 1-13, Stanford (1995)
15. [SCHW00] Schwichtenberg, H.: Feasible programs from proofs, preprint, January 7, (2000)
16. [SI88] Simmons, H.: The realm of primitive recursion, Archive for Mathematical Logic, 27, 177-188 (1988)
17. [STR97] Strahm, T.: Polynomial time operations in explicit mathematics, Journal of Symbolic Logic, 62, 575-594 (1997)
18. [STR00] Strahm, T.: Theories with self-application and computational complexity, Preprint, Bern, May 17, (2000)
19. [TS97] Troelstra, A. S., Schwichtenberg H.: Basic Proof Theory, Cambridge U.P., (1997)