Realizability algebras: a program to well order R
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the existence of a well ordering of the real line. The principal tool...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Logical Methods in Computer Science e.V.
2011-08-01
|
| Σειρά: | Logical Methods in Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://lmcs.episciences.org/1070/pdf |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|