A new “feasible” arithmetic
From MaRDI portal
Publication:4532603
DOI10.2178/jsl/1190150032zbMath1006.03035MaRDI QIDQ4532603
Martin Hofmann, Stephen J. Bellantoni
Publication date: 29 October 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1190150032
quantified modal logic; Curry-Howard isomorphism; provably total functions; feasible arithmetic; polynomial-time computable functions
Related Items
Radical anti-realism, Wittgenstein and the length of proofs, An arithmetic for polynomial-time computation, Tiering as a Recursion Technique
Cites Work
- Unnamed Item
- Computational interpretations of linear logic
- Intensional mathematics
- The realm of primitive recursion
- Constructivism in mathematics. An introduction. Volume I
- Bounded linear logic: A modular approach to polynomial-time computability
- A new recursion-theoretic characterization of the polytime functions
- Light linear logic
- Safe recursion with higher types and BCK-algebra
- Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers
- Epistemic arithmetic is a conservative extension of intuitionistic arithmetic