|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
An overview of nominal algebra, lattice, representation and dualities for computer science foundations
If you have a question about this talk, please contact Jonathan Hayman.
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.
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 listsCollaborative research symposium. Funding available for collaborative research out of Science and Technology Funding Council areas. China Research Seminar Series Heritage Research Group Annual Fair
Other talksLangtoft’s Chronicle: Multilingualism of the Other mySociety Meetup Methods and math in Cognitive Neuroscience Women Fit For Ambition? Extreme pattern of genetic diversity in humans What have we learnt about the causes of ADHD?