Skip Navigation


Journal of Logic and Computation Advance Access originally published online on October 14, 2008
Journal of Logic and Computation 2009 19(2):341-367; doi:10.1093/logcom/exn055
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
19/2/341    most recent
exn055v4
exn055v3
exn055v2
exn055v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gabbay, M. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

Nominal Algebra and the HSP Theorem

Murdoch J. Gabbay 1

Department of Computer Science, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS, UK.

Received 1 November 2007.


  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 characterizes the class of models of an algebraic theory as a class closed under homomorphic images, subalgebras and products, and is a fundamental result of universal algebra. It is not obvious that nominal algebra should satisfy the HSP theorem: nominal algebra axioms are subject to so-called freshness conditions which give them some flavour of implication; nominal sets have significantly richer structure than the sets semantics traditionally used in universal algebra. The usual method of proof for the HSP theorem does not obviously transfer to the nominal algebra setting. In this article, we give the constructions which show that, after all, a ‘nominal’ version of the HSP theorem holds for nominal algebra; it corresponds to closure under homomorphic images, subalgebras, products and an atoms-abstraction construction specific to nominal-style semantics.

Keywords: Universal algebra; equational logic; nominal algebra; HSP or Birkhoff's theorem; nominal sets; nominal terms

1Homepage: http://www.gabbay.org.uk


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
M. J. Gabbay and A. Mathijssen
A Nominal Axiomatization of the Lambda Calculus
J Logic Computation, September 13, 2009; (2009) exp049v1.
[Abstract] [PDF]

Home page
 J Logic ComputationHome page
M. J. Gabbay and A. Mathijssen
Nominal (Universal) Algebra: Equational Logic with Names and Binding
J Logic Computation, July 5, 2009; (2009) exp033v1.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.