Actual arithmetic and feasibility

1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Keywords :
Type de document :
Communication dans un congrès
L. Fribourg. International Workshop on Computer Science Logic - CSl'2001, 2001, Paris, France, Springer, 2142, pp.115--129, 2001, Lecture notes in Computer Science
Domaine :

https://hal.inria.fr/inria-00100424
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:43:37
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

• HAL Id : inria-00100424, version 1

Citation

Jean-Yves Marion. Actual arithmetic and feasibility. L. Fribourg. International Workshop on Computer Science Logic - CSl'2001, 2001, Paris, France, Springer, 2142, pp.115--129, 2001, Lecture notes in Computer Science. 〈inria-00100424〉

Métriques

Consultations de la notice