Knowledge Spaces and the Completeness of Learning Strategies

Authors Stefano Berardi, Ugo de'Liguoro

Thumbnail PDF


  • Filesize: 499 kB
  • 15 pages

Document Identifiers

Author Details

Stefano Berardi
Ugo de'Liguoro

Cite AsGet BibTex

Stefano Berardi and Ugo de'Liguoro. Knowledge Spaces and the Completeness of Learning Strategies. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 77-91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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 state together with a new topology, capturing finite positive and negative information that guides a learning strategy. We use a leading example to illustrate how non-constructive proofs lead to continuous and effective learning strategies over knowledge spaces, and prove that our learning semantics is sound and complete w.r.t. classical truth, as it is the case for Coquand's and Krivine's approaches.
  • Classical Logic
  • Proof Mining
  • Game Semantics
  • Learning
  • Realizability


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads