Complemented subsets and Boolean-valued, partial functions

Article type: Research Article

Authors: Misselbeck-Wessel, Daniel^{a; *} | Petrakis, Iosif^b

Affiliations: [a] Alfried Krupp Wissenschaftskolleg Greifswald, Germany | [b] Department of Computer Science, University of Verona, Italy

Correspondence: [*] Corresponding author. daniel.misselbeck-wessel@wiko-greifswald.de.

Abstract: We study the two algebras of complemented subsets that were introduced in the constructive development of the Daniell approach to measure and integration within Bishop-style constructive mathematics. We present their main properties both for the so-called here categorical complemented subsets and for the extensional complemented subsets. We translate constructively the classical bijection between subsets and Boolean-valued, total functions by establishing a bijection between complemented subsets (categorical or extensional) and Boolean-valued, partial functions (categorical or extensional). The role of Myhill’s axiom of non-choice in the equivalence between categorical and extensional subsets is discussed. We introduce swap algebras of type (I) and (II) as an abstract version of Bishop’s algebras of complemented subsets of type (I) and (II), respectively, and swap rings as an abstract version of the structure of Boolean-valued partial functions on a set. Our examples of swap algebras and swap rings together with the included here results indicate that their theory is a certain generalisation of the theory of Boolean algebras and Boolean rings, a fact which we find interesting both from a constructive and a classical point of view.

Keywords: Constructive mathematics, Bishop set theory, complemented subsets, partial functions, swap algebras

DOI: 10.3233/COM-230462

Journal: Computability, vol. Pre-press, no. Pre-press, pp. 1-33, 2024