Apparaît dans les collections : 14th International workshop in set theory / XIVe Atelier international de théorie des ensembles, Exposés de recherche

We discuss classical realizability, a branch of mathematical logic that investigates the computational content of mathematical proofs by establishing a correspondence between proofs and programs. Research in this field has led to the development of highly technical constructions generalizing the method of forcing in set theory. In particular, models of realizability are models of ZF, and forcing models are special cases of realizability models.