Actual arithmetic and feasibility - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Actual arithmetic and feasibility


This paper presents a methodology for reasoning about the computational complexity of functional programs. We introduce a first order arithmetic $\StrictTa$ which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which are provably total in $\StrictTa$, is exactly the set of polynomial time functions.The cut-elimination process is polynomial time computable. Compared to others feasible arithmetics, $\StrictTa$ is conceptually simpler. The main feature of $\StrictTa$ concerns the treatment of the quantification. The range of quantifiers is restricted to the set of {\em actual terms} which is the set of constructor terms with variables. The inductive formulas are restricted to conjunctions of atomic formulas.
Not file

Dates and versions

inria-00100424 , version 1 (26-09-2006)


  • HAL Id : inria-00100424 , version 1


Jean-Yves Marion. Actual arithmetic and feasibility. International Workshop on Computer Science Logic - CSl'2001, 2001, Paris, France, pp.115--129. ⟨inria-00100424⟩
38 View
0 Download


Gmail Facebook Twitter LinkedIn More