University of Birmingham > Talks@bham > Theoretical computer science seminar > Permissive-Nominal Logic

## Permissive-Nominal LogicAdd to your list(s) Download to your calendar using vCal - Murdoch Gabbay, Heriot-Watt University
- Friday 18 February 2011, 16:00-17:00
- UG40 Computer Science.
If you have a question about this talk, please contact Paul Levy. Permissive-Nominal Logic (PNL) extends first-order logic
with names and binding, enabling e.g. finite axiomatisations of
substitution, lambda-calculus, first-order logic, and also of
arithmetic. You should really imagine PNL as being This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG40 Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsJane Langdale Metallurgy & Materials – Tech Entrepreneurship Seminar Series Biosciences seminars## Other talksThe tragic destiny of Mileva Marić Einstein TBC Horizontal Mean Curvature Flow and stochastic optimal controls Life : it’s out there, but what and why ? Control variates for computing transport coefficients Hunt for an Earth-twin |