This work is devoted to Krivine's Realizability, focusing over computational aspects of realizers. Each formula has associated a game. Each proof of a formula gives a term implementing a winning strategy for the game associated to the proven formula. A proof is, by soundness, a combinator capable to take winning strategies of the premises and furnish a winning strategy for the conclusion. Are treated the following topics: A. The specification problem, which consists in characterize all realizers of a given formula in computational terms. Many examples are given. B. We study a proof as a combinator of winning strategies: Consider an implication $A\to B$ where $A$ and $B$ are $\Sigma^0_2$ formulae. Consider $C$ the prenex normal form of the i...
This thesis deals with the splitting method first introduced in rare event analysis in order to spee...
Our thesis in mathematics education explores the relevance of story building as a pat- tern of thoug...
The multiplication of polynomials is a fundamental operation in complexity theory. Indeed, for many ...
Cet article s’intéresse aux rôles des exemples dans l’élaboration des démonstrations mathématiques a...
This thesis investigates two realizability models for classical logic built on HO game semantics. Th...
The last couple of decades have seen a surge of interest and sophistication in using heuristics to s...
This thesis is devoted to the study of several aspects of the asymptotic behavior of repeated games ...
The thesis is motivated by the problems related to the defaults correlation in the portfolio credit ...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
The last couple of decades have seen a surge of interest and sophistication in using heuristics to s...
peer reviewedLa littérature consacrée aux études du jeu est ponctuée de renvois à de multiples conce...
This PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we ...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
Beware, this abstract comports irony and humor. In this dissertation, we defend the idea that, for a...
In this thesis, we formalize and study operatorial transformations of general dy- namic problems (no...
This thesis deals with the splitting method first introduced in rare event analysis in order to spee...
Our thesis in mathematics education explores the relevance of story building as a pat- tern of thoug...
The multiplication of polynomials is a fundamental operation in complexity theory. Indeed, for many ...
Cet article s’intéresse aux rôles des exemples dans l’élaboration des démonstrations mathématiques a...
This thesis investigates two realizability models for classical logic built on HO game semantics. Th...
The last couple of decades have seen a surge of interest and sophistication in using heuristics to s...
This thesis is devoted to the study of several aspects of the asymptotic behavior of repeated games ...
The thesis is motivated by the problems related to the defaults correlation in the portfolio credit ...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
The last couple of decades have seen a surge of interest and sophistication in using heuristics to s...
peer reviewedLa littérature consacrée aux études du jeu est ponctuée de renvois à de multiples conce...
This PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we ...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
Beware, this abstract comports irony and humor. In this dissertation, we defend the idea that, for a...
In this thesis, we formalize and study operatorial transformations of general dy- namic problems (no...
This thesis deals with the splitting method first introduced in rare event analysis in order to spee...
Our thesis in mathematics education explores the relevance of story building as a pat- tern of thoug...
The multiplication of polynomials is a fundamental operation in complexity theory. Indeed, for many ...