|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 listsCurrent Research Topics (Computer Laboratory) 2010-11 CRIA Arcsoc Dutch
Other talksInvestigating Cultures of Community Energy Peru, from coast to the Andes The Rotational Degrees of Freedom of a Granular Packing Microbial Community Networks in the Human Microbiome The Falcon Rocket System and the development of rockets for the Bloodhound project. Topological Constraints Do Matter: Polymer Melts, Elastomers, Collapsed Polymer Globules, Chromosome Territories etc