BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An overview of nominal algebra\, lattice\, representation and dual
 ities for computer science foundations - Jamie Gabbay
DTSTART:20130702T130000Z
DTEND:20130702T140000Z
UID:TALK45616@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:Nominal algebra lets us axiomatise substitution and quantifier
 s\, and thus\nthe new-quantifier\, first-order logic\, and the lambda-calc
 ulus.  Nominal\nlattice theory lets us characterise binders as greatest an
 d least upper\nbounds subject to freshness conditions\; this is possible f
 or "forall" and\n"exists" and surprisingly also for "lambda".\n\nFrom this
  follow a body of soundness\, completeness\, representation\, and\ntopolog
 ical duality results for algebraic/lattice-theoretic theories in\nnominal 
 sets and topological spaces.  A great deal of structure is revealed\nby th
 is\, which I will outline.
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR