A proof theoretic approach to feasible computation

Jean-Yves Marion 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We introduce a first order calculus which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which is provable in this calculus is exactly the set of polynomial time functions.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00099327
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:52:53 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00099327, version 1

Collections

Citation

Jean-Yves Marion. A proof theoretic approach to feasible computation. [Interne] A00-R-375 || marion00d, 2000, 17 p. ⟨inria-00099327⟩

Share

Metrics

Record views

158