From forcing models to realizability models

Laura Fontanella
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.
This data center is not currently reporting usage information. For information on how your repository can submit usage information, please see our Documentation.