Computer Science – Logic in Computer Science
Scientific paper
2010-05-17
Computer Science
Logic in Computer Science
Scientific paper
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.
Berardi Stefano
de'Liguoro Ugo
No associations
LandOfFree
Interactive Realizers and Monads does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interactive Realizers and Monads, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interactive Realizers and Monads will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-298557