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 Abstract Freely available
Right arrow Full Text (PDF)
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.

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



References

  1. Birkhoff G. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society (1935) 31:433–454.[CrossRef]
  2. Burris S, Sankappanavar H. A Course in Universal Algebra (1981) Berlin, Germany: Springer.
  3. Cheney J, Urban C. System description: Alpha-Prolog, a fresh approach to logic programming modulo alpha-equivalence. In. In: Proceedings of the 17th International Workshop on Unification, UNIF’03 (2003) Spain: Universidad Politecnica de Valencia. 15–19.
  4. Clouston RA, Pitts AM. Nominal equational logic. ENTCS (2007) 172:223–257.
  5. de Bruijn NG. Checking mathematics with computer assistance. Notices of the American Mathematical Society (AMS) (1991) 38:8–15.
  6. Fernández M, Gabbay Murdoch J. Nominal rewriting. Information and Computation (2007) 205:917–965.[CrossRef][Web of Science]
  7. Gabbay Murdoch J. Fresh logic. Journal of Applied Logic (2007) 5:356–387.[CrossRef]
  8. Gabbay Murdoch J, Mathijssen A. Capture-avoiding substitution as a nominal algebra. (2006) Berlin, Germany: Springer. 198–212. In ICTAC, Vol. 4281 of LNCS.
  9. Gabbay Murdoch J, Mathijssen A. A formal calculus for informal equality with binding. (2007) Berlin, Germany: Springer. 162–176. In WoLLIC’07: 14th Workshop on Logic, Language, Information and Computation, Vol. 4576 of LNCS.
  10. Gabbay Murdoch J, Mathijssen A. One-and-a-halfth-order Logic. Journal of Logic and Computation. 18:521–562.
  11. Gabbay Murdoch J, Mathijssen A. Capture-avoiding substitution as a nominal algebra. In: Formal Aspects of Computing (2008) 20. London: Springer. 451–479.[CrossRef][Web of Science]
  12. Gabbay Murdoch J, Pitts AM. A new approach to abstract syntax with variable binding. Formal Aspects of Computing (2001) 13:341–363.[CrossRef]
  13. Klop J-W, van Oostrom V, van Raamsdonk F. Combinatory reduction systems. Theoretical Computer Science (1993) 121:279–308.[CrossRef][Web of Science]
  14. Mac Lane S. Categories for the Working Mathematician (1971) Berlin, Germany: Springer. Vol. 5 of Graduate Texts in Mathematics.
  15. Manzonetto G, Salibra A. Boolean algebras for lambda calculus. In. (2006) Washington DC, USA: IEEE Computer Society. 317–326. 21th IEEE Symposium on Logic in Computer Science (LICS 2006).
  16. Mathijssen A. Logical Calculi for Reasoning with Binding (2007) The Netherlands: Technische Universiteit Eindhoven. PhD thesis.
  17. Mayr R, Nipkow T. Higher-order rewrite systems and their confluence. Theoretical Computer Science (1998) 192:3–29.[CrossRef][Web of Science]
  18. Pitts AM. Nominal logic, a first order theory of names and binding. Information and Computation (2003) 186:165–193.[CrossRef][Web of Science]
  19. Salibra A. Topological incompleteness and order incompleteness of the lambda calculus. ACM Transactions on Computational Logic (2003) 4:379–401.[CrossRef]
  20. Sun Y. An algebraic generalization of frege structures - binding algebras. Theoretical Computer Science (1999) 211:189–232.[CrossRef][Web of Science]
  21. Urban C, Pitts AM, Gabbay Murdoch J. Nominal unification. Theoretical Computer Science (2004) 323:473–497.[CrossRef][Web of Science]

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]

This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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?