Permissive-Nominal Logic

Add 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 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.

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.