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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Consistency of Quine's NF using nominal techniques

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Algebra Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ (Room To Be Confirmed) DAMTP Departmental Seminar

Other talks

Talk TBC Formal Dinner at Selwyn College Machine Learning for Spectral Geometry and Vice Versa The Imagined Conflict: On Science and God Title to be confirmed Talk title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity