Exposés de recherche

Collection Exposés de recherche

00:00:00 / 00:00:00
290 380

From forcing models to realizability models

By Laura Fontanella

Also appears in collection : 14th International workshop in set theory / XIVe Atelier international de théorie des ensembles

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.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19228203
  • Cite this video Fontanella, Laura (10/10/2017). From forcing models to realizability models. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19228203
  • URL https://dx.doi.org/10.24350/CIRM.V.19228203

Domain(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback