Stefano Berardi ; Ugo de'Liguoro - Knowledge Spaces and the Completeness of Learning Strategies

lmcs:729 - Logical Methods in Computer Science, February 12, 2014, Volume 10, Issue 1 - https://doi.org/10.2168/LMCS-10(1:9)2014
Knowledge Spaces and the Completeness of Learning Strategies

Authors: 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 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.


    Volume: Volume 10, Issue 1
    Published on: February 12, 2014
    Accepted on: June 25, 2015
    Submitted on: January 18, 2013
    Keywords: Computer Science - Logic in Computer Science,Mathematics - Logic

    Linked data

    Source : ScholeXplorer IsPartOf DOI 10.4230/lipics.csl.2012
    • 10.4230/lipics.csl.2012
    LIPIcs, Volume 16, CSL'12, Complete Volume
    Durand, Arnaud ;

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 360 times.
    This article's PDF has been downloaded 213 times.