Nominal algebra and the HSP theorem

Journal of Logic and Computation

Volumn 19, Issue 2, 2009, Pages 341-367

  Gabbay, Murdoch J ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Equational logic; HSP or Birkhoffs theorem; Nominal algebra; Nominal sets; Nominal terms; Universal algebra

Indexed keywords

EQUATIONAL LOGIC; HSP OR BIRKHOFFS THEOREM; NOMINAL ALGEBRA; NOMINAL SETS; NOMINAL TERMS; UNIVERSAL ALGEBRA;

BIOMINERALIZATION; FORMAL LOGIC; IMAGE QUALITY; INFORMATION THEORY; SEMANTICS;

ALGEBRA;

EID: 65249121424     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exn055     Document Type: Article

References (21)

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