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.
Type de document :
Rapport
[Interne] A00-R-375 || marion00d, 2000, 17 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00099327
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:52:53
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

146