SearcharxivSearch

arXiv · 2106.14398

Override and restricted union for partial functions

Abstract

The {\em override} operation $\sqcup$ is a natural one in computer science, and has connections with other areas of mathematics such as hyperplane arrangements. For arbitrary functions $f$ and $g$, $f\sqcup g$ is the function with domain $dom(f)\cup dom(g)$ that agrees with $f$ on $dom(f)$ and with $g$ on $dom(g) \backslash dom(f)$. Jackson and the author have shown that there is no finite axiomatisation of algebras of functions of signature $(\sqcup)$. But adding operations (such as {\em update}) to this minimal signature can lead to finite axiomatisations. For the functional signature $(\sqcup,\backslash)$ where $\backslash$ is set-theoretic difference, Cirulis has given a finite equational axiomatisation as subtraction o-semilattices. Define $f\curlyvee g=(f\sqcup g)\cap (g\sqcup f)$ for all functions $f$ and $g$; this is the largest domain restriction of the binary relation $f\cup g$ that gives a partial function. Now $f\cap g=f\backslash(f\backslash g)$ and $f\sqcup g=f\curlyvee(f\curlyvee g)$ for all functions $f,g$, so the signatures $(\curlyvee)$ and $(\sqcup,\cap)$ are both intermediate between $(\sqcup)$ and $(\sqcup,\backslash)$ 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Tim Stokes. 2021-06-28. Override and restricted union for partial functions. https://arxiv.org/abs/2106.14398

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO