scientific article; zbMATH DE number 1848310

MaRDI QIDQ4785504zbMATH OpenFDO

Authors Jean-Yves Marion

Publication date 25 February 2003

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30) Functional programming and lambda calculus (68N18)

Recommendations

• A new “feasible” arithmetic
• An arithmetic for polynomial-time computation
• Some applications of logic to feasibility in higher types
• An arithmetic for non-size-increasing polynomial-time computation
• Publication:3472100

Cited in

(7)

• An arithmetic for polynomial-time computation
• Adventures in time and space
• Adventures in time and space
• Theoretical computer science: computational complexity
• Intrinsic reasoning about functional programs. I: First order theories
• A new “feasible” arithmetic
• scientific article; zbMATH DE number 2110622 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785504)