|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 listsSt. John's Women's Society Talks Wednesday Lunch Time Seminar Series Type the title of a new list here
Other talksCell scaffold dimensional metrology using high resolution 3D printing methods and machine learning Plant cytoskeletons A solid state conceptualization of information transfer from gene to message to protein Causes of ice-age intensification across the Mid-Pleistocene Transition, insights from a new boron isotope CO2 record Stem cell derived extracellular matrix as a cell culture substrate elicits very different and desirable cell behaviours versus standard plastic substrates 'It's Not My Story to Tell': Ownership, Legitimacy, and the Politics of History in Mocimboa da Praia, Mozambique