Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

PLT: Type Theory 4 - ZFC set theory (part 4)

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
632 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Apr 27, 2011

The last two axioms of the ZFC set theory and a quick review.

Link to this comment:

Share to:
see all

All Comments (6)

Sign In or Sign Up now to post a comment!
  • @riteofwhey Sorry, not yet...

  • I enjoy this, thanks! Has the type theory stuff been posted yet? and if so where?

  • @locke1689gmail Hi locke, yes if you turn on the youtube annotations, you'll see some errata. Sorry about the errors, I'm also learning the topics as I go along :). Can't promise anything but I'd like to come back and redo some of these in a year or two.

  • Your empty set axiom is wrong. It should be: There exists an empty st. forall x, x is not a member of the empty set.

    The topics you have are interesting but you really need to work out ahead of time what you're going to say. You make so many mistakes that it is difficult to follow.

  • @Ormaaj I'm really glad that you're enjoying it so far! You're quite right, this is more a sort of historical intro that I hope to use to contrast with type theory. Keep in mind that I'm also teaching myself as I go along. My feeling was that most beginners don't really understand why we can't just use set theory as a foundation for type systems. I hope that I'll manage to illustrate differences in how set theory and type theory is stratified. But perhaps I should leave some mystery :)

  • Now I'm on the edge of my seat with where you're going with this. I first filled half a notebook on the axioms trying to cram this into my skull probably 3 years ago and still come back to them now and then. I can't say I've ever had a major epiphany as a result. They still seem kind of ethereal. Unless my understanding is fundamentally flawed (hopefully not) it's possible to get the semantics of typed lambda calculi and Hindley-Milnerish types without too much stress over the details of ZFC.

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more