2026-07-22T12:14:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3665 2024-03-06T10:34:20Z ddc:004 open_access

Knowledge Spaces and the Completeness of Learning Strategies Berardi, Stefano de'Liguoro, Ugo Classical Logic Proof Mining Game Semantics Learning Realizability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefano Berardi and Ugo de'Liguoro 2012 Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2012.77 urn:nbn:de:0030-drops-36656 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.77 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode