|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 listsBiology and the Arguments of Utility Caius Medsoc Talks: "A Timeline of Medicine" Group Theory, Geometry and Representation Theory: Abel Prize 2008
Other talksDeep consequences: Why syntax (as we know it) isn't a thing, and other (shocking?) conclusions from modelling language with neural nets. Development & Plasticity of the Brain (TBC) The Surrey Communication and Language in Education Study (SCALES): a population study of language impairment at school entry Ethnic differences in mental health: does race matter? Microbiota-host interplay in the intestine and its impact on health and disease Insecure processing of cookies in modern web applications and browsers