![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Jamie Gabbay
Tuesday 02 July 2013, 14:00-15:00
An overview of nominal algebra, lattice, representation and dualities for computer science foundations
- đ¤ Speaker: Jamie Gabbay
- đ Date & Time: Tuesday 02 July 2013, 14:00 - 15:00
- đ Venue: Room FW26, Computer Laboratory, William Gates Building
Questions? Contact
Jonathan Hayman
Abstract
Nominal algebra lets us axiomatise substitution and quantifiers, and thus the new-quantifier, first-order logic, and the lambda-calculus. Nominal lattice theory lets us characterise binders as greatest and least upper bounds subject to freshness conditions; this is possible for “forall” and “exists” and surprisingly also for “lambda”.
From this follow a body of soundness, completeness, representation, and topological duality results for algebraic/lattice-theoretic theories in nominal sets and topological spaces. A great deal of structure is revealed by this, which I will outline.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Programming Research Group Seminar
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.