Add to ORKGRapport interne.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
The first incompleteness theorem of Kurt Gödel states that a theory in which we can develop most of ...
<p>I present a constructive prove that there exists a polynomial time algorithm to solve clique prob...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
AbstractA notion of feasible function of finite type based on the typed lambda calculus is introduce...
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs a...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
International audienceWe provide a characterization of Ko's class of polynomial time computable func...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
Just as P = NP if and only if some NP-complete set ; is a member of P, the class NP is closed unde...
AbstractWe define a restriction LHA of Heyting arithmetic HA with the property that all extracted pr...
AbstractIn this paper, we introduce and study some syntactical fragments of monadic second-order and...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
AbstractSome problems concerning the satisfiability of first-order predicate calculus formulae in Sc...
The first incompleteness theorem of Kurt Gödel states that a theory in which we can develop most of ...
<p>I present a constructive prove that there exists a polynomial time algorithm to solve clique prob...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
AbstractA notion of feasible function of finite type based on the typed lambda calculus is introduce...
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs a...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
International audienceWe provide a characterization of Ko's class of polynomial time computable func...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
Just as P = NP if and only if some NP-complete set ; is a member of P, the class NP is closed unde...
AbstractWe define a restriction LHA of Heyting arithmetic HA with the property that all extracted pr...
AbstractIn this paper, we introduce and study some syntactical fragments of monadic second-order and...
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservat...
AbstractSome problems concerning the satisfiability of first-order predicate calculus formulae in Sc...
The first incompleteness theorem of Kurt Gödel states that a theory in which we can develop most of ...
<p>I present a constructive prove that there exists a polynomial time algorithm to solve clique prob...
We present a Coq library that allows for readily proving that a function is computable in polynomial...