A new "feasible" arithmetic

Journal of Symbolic Logic

Volumn 67, Issue 1, 2002, Pages 104-116

  Bellantoni, Stephen ^a   Hofmann, Martin ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036002868     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1190150032     Document Type: Article

References (25)

1. Computational interpretations of linear logic
2. Ranking arithmetic proofs by implicit ramification
3. A new recursion, theoretic characterization of the polytime functions
4. Ranking recursions: The low Grzegorczyk hierarchy reconsidered
5. Ramification, modality, and linearity in higher type recursion
6. Provability: The emergence of a mathematical modality
7. Computational content of classical proofs
8. Bounded linear logic: A modular approach to polynomial-time computability
9. A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion
10. Safe recursion with higher types and BCK-algebras
11. Languages that capture complexity classes
12. Ramified recurrence and computational complexity I: Word recurrence and poly-time
13. Intrinsic theories and computational complexity
14. Ramified recurrence and computational complexity IV: Predicative functionals and poly-space
15. Understanding intuitionism
16. Epistemic and intuitionistic arithmetic
17. The realm of primitive recursion