Nominal Equational Logic | Zendy

Ranald Clouston | Zendy; Andrew M. Pitts | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Nominal Equational Logic

Author(s) -

Ranald Clouston,

Andrew M. Pitts

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.02.009

Subject(s) - equational logic , interpretation (philosophy) , extension (predicate logic) , computer science , programming language , algebra over a field , mathematics , discrete mathematics , theoretical computer science , arithmetic , pure mathematics , rewriting

This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal sets model of names, binding and α-conversion

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research