University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Consistency of Quine's NF using nominal techniques

Consistency of Quine's NF using nominal techniques

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jonathan Hayman.

I will outline a proof of the consistency of Quine’s New Foundations using nominal techniques.

I will describe NF, why its consistency matters, why it is difficult to prove, and outline how the “nominal” proof works—- going into as much or as little technical detail as the audience prefer.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity