scientific article; zbMATH DE number 1848310

zbMATH Open1005.68039MaRDI QIDQ4785504FDOQ4785504

Authors: Jean-Yves Marion 

Publication date: 25 February 2003

Title of this publication is not available (Why is that?)

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

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)

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
• Title not available (Why is that?)

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)