43 citations · 72 across the 14 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
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…
cs.LO2010★ 2 cited
Interactive Realizers and Monads
Stefano Berardi, Ugo de'Liguoro
We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without "nested" quantifiers, calle…