English

Interactive Realizers and Monads

Logic in Computer Science 2015-03-17 v1

Abstract

We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without "nested" quantifiers, called here EM1-arithmetic. We interpret classical proofs as interactive learning strategies, namely as processes going through several stages of knowledge and learning by interacting with the "environment" and with each other. We give a categorical presentation of the interpretation through the construction of two suitable monads.

Keywords

Cite

@article{arxiv.1005.2907,
  title  = {Interactive Realizers and Monads},
  author = {Stefano Berardi and Ugo de'Liguoro},
  journal= {arXiv preprint arXiv:1005.2907},
  year   = {2015}
}
R2 v1 2026-06-21T15:23:46.850Z