Nominal logic is a variant of first-order logic in which abstract syntax with names and binding is formalized in terms of two basic operations: name-swapping and freshness. It relies on two important principles: equivariance (validity is preserved by name-swapping), and fresh name generation ("new" or fresh names can always be chosen)
We introduce permissive nominal terms, and their unification. Nominal terms are one way to extend fi...
We present an expressive but decidable first-order system (named MAV1) defined by using the calculus...
AbstractMemory logics are a family of modal logics in which standard relational structures are augme...
Nominal logic is an extension of first-order logic which provides a simple foundation for formalizin...
AbstractThis paper formalises within first-order logic some common practices in computer science to ...
AbstractIn this paper we introduce Fresh Logic, a natural deduction style first-order logic extended...
Nominal logic is a variant of first-order logic equipped with a "freshname quantifier" N ...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
AbstractNominal logic is an extension of first-order logic with features useful for reasoning about ...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
AbstractMany formal systems, particularly in computer science, may be expressed through equations mo...
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers ...
When reasoning about formal languages, dealing with binding constructs is of-ten delicate and error-...
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are ex...
The practice of first-order logic is replete with meta-level concepts. Most notably there are the me...
We introduce permissive nominal terms, and their unification. Nominal terms are one way to extend fi...
We present an expressive but decidable first-order system (named MAV1) defined by using the calculus...
AbstractMemory logics are a family of modal logics in which standard relational structures are augme...
Nominal logic is an extension of first-order logic which provides a simple foundation for formalizin...
AbstractThis paper formalises within first-order logic some common practices in computer science to ...
AbstractIn this paper we introduce Fresh Logic, a natural deduction style first-order logic extended...
Nominal logic is a variant of first-order logic equipped with a "freshname quantifier" N ...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
AbstractNominal logic is an extension of first-order logic with features useful for reasoning about ...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
AbstractMany formal systems, particularly in computer science, may be expressed through equations mo...
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers ...
When reasoning about formal languages, dealing with binding constructs is of-ten delicate and error-...
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are ex...
The practice of first-order logic is replete with meta-level concepts. Most notably there are the me...
We introduce permissive nominal terms, and their unification. Nominal terms are one way to extend fi...
We present an expressive but decidable first-order system (named MAV1) defined by using the calculus...
AbstractMemory logics are a family of modal logics in which standard relational structures are augme...