For more information about this meeting, contact Stephen Simpson.
|Title:||The Compactness Theorem for propositional logic: the uncountable case|
|Speaker:||Jacob Hendricks, Phil Hudelson, Noopur Pathak, The Pennsylvania State University|
|We consider the Compactness Theorem for propositional logic with a possibly uncountable number of atoms. Three proofs of the theorem will be presented, based respectively on Zorn's Lemma, transfinite induction, and Tychonoff's Theorem. As time permits we shall consider applications to infinitary combinatorics.|
Room Reservation Information
|Date:||09 / 02 / 2008|
|Time:||02:30pm - 03:45pm|