Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
We apply to the semantics of Arithmetic the idea of ``finite approximation'' used to provide computational interpretations of Herbrand's Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for $\vee, \exists$) over a suitable structure $\StructureN$ for the lan...
Spremljeno u:
| Glavni autori: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Logical Methods in Computer Science e.V.
2010-09-01
|
| Serija: | Logical Methods in Computer Science |
| Teme: | |
| Online pristup: | https://lmcs.episciences.org/1061/pdf |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|