On universal algebra over nominal sets

Authors:
Alexander Kurz;Daniela PetriŞ/an
Affiliations:
Department of computer science, university of leicester, uk email: kurz@mcs.le.ac.uk/ petrisan@mcs.le.ac.uk;Department of computer science, university of leicester, uk email: kurz@mcs.le.ac.uk/ petrisan@mcs.le.ac.uk
Venue:
Mathematical Structures in Computer Science
Year:
2010

Citing 11
Cited 4

Abstract and concrete categories

Abstract and concrete categories
A New Approach to Abstract Syntax Involving Binders

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Pi-Calculus in Logical Form

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Free-algebra models for the π -calculus

Theoretical Computer Science
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties

Electronic Notes in Theoretical Computer Science (ENTCS)
Term Equational Systems and Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Algebra and the HSP Theorem

Journal of Logic and Computation
Nominal (Universal) Algebra

Journal of Logic and Computation
Presenting functors by operations and equations

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Presenting functors on many-sorted varieties and applications

Information and Computation
Equational presentations of functors and monads

Mathematical Structures in Computer Science
Nominal lawvere theories

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Stone duality for nominal Boolean algebras with И

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full reflective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a ‘uniform’ fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into ‘uniform’ theories, and systematically prove HSP theorems for models of these theories.