We apply to the semantics of Arithmetic the idea of``finite approximation''used to provide
computational interpretations of Herbrand's Theorem, and we interpret classical proofs as …

We associate with any game G another game, which is a variant of it, and which we call bck
(G). Winning strategies for bck (G) have a lower recursive degree than winning strategies for …

In this dissertation we provide mathematical evidence that the concept of learning can be
used to give a new and intuitive computational semantics of classical proofs in various …

We propose a realizability interpretation of a system for quantier free arithmetic which is
equivalent to the fragment of classical arithmetic without nested quantifiers, called here EM 1 …

In this dissertation we collect some results about" interactive realizability", a realizability
semantics that extends the Brouwer-Heyting-Kolmogorov interpretation to (sub-) classical …

We introduce an extension of first-order logic that comes equipped with additional
predicates for reasoning about an abstract state. Sequents in the logic comprise a main …

We present abstract complexity results about Coquand and Hyland–Ong game semantics,
that will lead to new bounds on the length of first-order cut-elimination, normalization …

We prove that interactive learning based classical realizability (introduced by Aschieri and
Berardi for first order arithmetic) is sound with respect to Coquand game semantics. In …

We propose a theory of learning aimed to formalize some ideas underlying Coquand's game
semantics and Krivine's realizability of classical logic. We introduce a notion of knowledge …

We propose a realizability interpretation of a system for quantifier free arithmetic which is
equivalent to the fragment of classical arithmetic without" nested" quantifiers, called here …