43 citations · 72 across the 14 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.LO2014★ 3 cited
Proving termination with transition invariants of height omega
Stefano Berardi, Paulo Oliva, Silvia Steila
The Termination Theorem by Podelski and Rybalchenko states that the reduction relations which are terminating from any initial state are exactly the reduction relations whose trans…
cs.LO2014★ 6 cited
Knowledge Spaces and the Completeness of Learning Strategies
Stefano Berardi, Ugo de'Liguoro
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…
cs.LO2014
An intuitionistic version of Ramsey Theorem (italian version)
Stefano Berardi
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated…