4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.LO2012★ 1 cited
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
Federico Aschieri, Margherita Zorzi
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result - which s…
cs.LO2011★ 4 cited
Interactive Learning Based Realizability and 1-Backtracking Games
Federico Aschieri
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…