Realizability algebras III : some examples
Résumé
We 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.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...