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

Permissive-Nominal Logic

Add to your list(s) Download to your calendar using vCal

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 almost exactly like first-order logic, but with a term language that is nominal terms (and so has names and binding).
I will sketch PNL , why we created it, and how I envisage it being applied. Further details, including relevant papers, can be found on my papers page.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.