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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2011-08-01
|
| coleção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | https://lmcs.episciences.org/1070/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|