Permissive-nominal logic

DOI10.1145/2287718.2287720zbMath1352.03042OpenAlexW2086167281WikidataQ130849063 ScholiaQ130849063MaRDI QIDQ2946669

Gilles Dowek, Murdoch James Gabbay

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2287718.2287720

zbMATH Keywords

permutationnominal setspermissive-nominal logicnames and binding

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (3)

Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free ⋮ Unity in nominal equational reasoning: the algebra of equality on nominal sets ⋮ PNL to HOL: from the logic of nominal sets to the logic of higher-order functions

This page was built for publication: Permissive-nominal logic