2008
DOI: 10.1093/logcom/exn055
|View full text |Cite
|
Sign up to set email alerts
|

Nominal Algebra and the HSP Theorem

Abstract: Nominal algebra is a logic of equality developed to reason algebraically in the presence of binding. In previous work it has been shown how nominal algebra can be used to specify and reason algebraically about systems with binding, such as first-order logic, the lambda-calculus, or process calculi. Nominal algebra has a semantics in nominal sets (sets with a finitely-supported permutation action); previous work proved soundness and completeness. The HSP theorem characterises the class of models of an algebraic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
27
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(28 citation statements)
references
References 11 publications
1
27
0
Order By: Relevance
“…We prove that these translations are semantically invariant and we obtain an HSPA theorem for nominal equational logic and a new proof of the HSPA theorem of nominal algebra (Gabbay, 2008).…”
Section: Introductionmentioning
confidence: 91%
See 4 more Smart Citations
“…We prove that these translations are semantically invariant and we obtain an HSPA theorem for nominal equational logic and a new proof of the HSPA theorem of nominal algebra (Gabbay, 2008).…”
Section: Introductionmentioning
confidence: 91%
“…This paper describes a step towards universal algebra over nominal sets. There has been some work in this direction, most notably by M.J. Gabbay (Gabbay, 2008). The originality of our approach is that we do not start from the analogy between sets and nominal sets.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations