Location of Repository

Realizability algebras III : some examples

By Jean-Louis Krivine


30 pagesInternational audienceWe 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: Curry-Howard correspondence, combinatory logic, set theory, MSC 03E35; ACM F.4.1, [ INFO.INFO-LO ] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: Cambridge University Press (CUP)
Year: 2018
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.