43 citations · 77 across the 16 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.LO2010★ 3 cited
Learning, Realizability and Games in Classical Arithmetic
Federico Aschieri
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 fr…
cs.LO2010★ 43 cited
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
Federico Aschieri, Stefano Berardi
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…