Override and restricted union for partial functions
Abstract
The {\em override} operation is a natural one in computer science, and has connections with other areas of mathematics such as hyperplane arrangements. For arbitrary functions and , is the function with domain that agrees with on and with on . Jackson and the author have shown that there is no finite axiomatisation of algebras of functions of signature . But adding operations (such as {\em update}) to this minimal signature can lead to finite axiomatisations. For the functional signature where is set-theoretic difference, Cirulis has given a finite equational axiomatisation as subtraction o-semilattices. Define for all functions and ; this is the largest domain restriction of the binary relation that gives a partial function. Now and for all functions , so the signatures and are both intermediate between and in expressive power. We show that each is finitely axiomatised, with the former giving a proper quasivariety and the latter the variety of associative distributive o-semilattices in the sense of Cirulis.
Cite
@article{arxiv.2106.14398,
title = {Override and restricted union for partial functions},
author = {Tim Stokes},
journal= {arXiv preprint arXiv:2106.14398},
year = {2021}
}