Add to ORKGIn this paper we study (self-)applicative theories of operations and binary words in the context of polynomial time computability. We propose a first order theory PTO which allows full self-application and whose provably total functions on = {0, 1}* are exactly the polynomial time computable functions. Our treatment of PTO is proof-theoretic and very much in the spirit of reductive proof theor
The present article introduces ptarithmetic (short for “polynomial time arithmetic”) — a formal numb...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
In this paper we study (self-)applicative theories of operations and binary words in the context of ...
AbstractApplicative theories form the basis of Feferman’s systems of explicit mathematics, which hav...
AbstractSeveral authors have independently introduced second order theories whose provably total fun...
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than th...
We propose two admissible closures $${\mathbb{A}({\sf PTCA})}$$ and $${\mathbb{A}({\sf PHCA})}$$ of ...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type...
AbstractThis paper investigates analogs of the Kreisel–Lacombe–Shoenfield Theorem in the context of ...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The outcomes of this paper are twofold. Implicit complexity. We provide an implicit characterizatio...
The present article introduces ptarithmetic (short for “polynomial time arithmetic”) — a formal numb...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
In this paper we study (self-)applicative theories of operations and binary words in the context of ...
AbstractApplicative theories form the basis of Feferman’s systems of explicit mathematics, which hav...
AbstractSeveral authors have independently introduced second order theories whose provably total fun...
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than th...
We propose two admissible closures $${\mathbb{A}({\sf PTCA})}$$ and $${\mathbb{A}({\sf PHCA})}$$ of ...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type...
AbstractThis paper investigates analogs of the Kreisel–Lacombe–Shoenfield Theorem in the context of ...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The outcomes of this paper are twofold. Implicit complexity. We provide an implicit characterizatio...
The present article introduces ptarithmetic (short for “polynomial time arithmetic”) — a formal numb...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...