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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Logical Methods in Computer Science e.V.
2010-09-01
|
| Seri Bilgileri: | Logical Methods in Computer Science |
| Konular: | |
| Online Erişim: | https://lmcs.episciences.org/1061/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|