
TL;DR
This paper characterizes classes of disjoint-union partial algebras of sets and functions, providing recursive axiomatizations, proving non-finite axiomatizability in general, and identifying conditions for finite axiomatization when intersection is included.
Contribution
It offers the first-order axiomatization of disjoint-union partial algebras, explores their properties under various signatures, and establishes finite axiomatizability with intersection.
Findings
Classes are recursively axiomatizable but not finitely axiomatizable without intersection.
Adding intersection makes classes finitely axiomatizable.
Certain classes are not closed under elementary equivalence.
Abstract
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjoint-union partial algebra of sets but prove that no finite axiomatisation exists. We do the same for other signatures including one or both of disjoint union and subset complement, another partial binary operation we define. Domain-disjoint union is a partial binary operation on partial functions, returning the union if the arguments have disjoint domains and undefined otherwise. For each signature including one or both of domain-disjoint union and subset complement and optionally including composition, we consider the class of partial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
