Location of Repository

Realizability algebras III : some examples

By Jean-Louis Krivine


30 pagesWe use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives also a new method to get programs from proofs of arithmetical formulas with DC

Topics: combinatory logic, set theory, Curry-Howard correspondence, MSC 03E35; ACM F.4.1, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: HAL CCSD
Year: 2013
OAI identifier: oai:HAL:hal-00743120v2
Provided by: Hal-Diderot

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.