Skip to main content

Algebras of Complemented Subsets

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13359))

Abstract

Complemented subsets were introduced by Bishop, in order to avoid complementation in terms of negation. In his two approaches to measure theory Bishop used two sets of operations on complemented subsets. Here we study these two algebras and we introduce the notion of Bishop algebra as an abstraction of their common structure. We translate constructively the classical bijection between subsets and boolean-valued functions by establishing a bijection between the proper classes of complemented subsets and of strongly extensional, boolean-valued, partial functions. Avoiding negatively defined concepts, most of our results are within minimal logic.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The type-theoretic interpretation of Bishop’s set theory into the theory of setoids [17, 18] is nowadays the standard way to understand Bishop sets. A categorical interpretation of Bishop sets is Palmgren’s constructive adaptation [16] of Lawvere’s elementary theory of the category of sets. In [9] Coquand views Bishop sets as a natural sub-presheaf of the universe in the cubical set model.

  2. 2.

    If XY are totalities an assignment routine f from X to Y is denoted by \(f :X \rightsquigarrow Y\). If XY are sets, \(f :X \rightsquigarrow Y\) is a function, if it respects their equalities. Their set is denoted by \(\mathbb {F}(X, Y)\). A function is an embedding, if it is an injection.

  3. 3.

    For the exact definition of this concept within \(\mathrm {BST}\), see [20], Sect. 4.9.

  4. 4.

    The dual to condition (ii), which is equivalent to it, is the equality

    $$ (\boldsymbol{A} \cap - \boldsymbol{A}) \cup \bigg (\boldsymbol{A} \cap \bigcup _{i \in I} \boldsymbol{\lambda }(i)\bigg ) =_{{\mathcal {P}^{\boldsymbol{]} \boldsymbol{[}}(X)}} (\boldsymbol{A} \cap - \boldsymbol{A}) \cup \bigg [\bigcup _{i \in I} \big (\boldsymbol{A} \cap \boldsymbol{\lambda }(i)\big )\bigg ],$$

    and it is the constructive counterpart to \(\boldsymbol{A} \cap \bigcup _{i \in I} \boldsymbol{\lambda }(i) =_{{\mathcal {P}^{\boldsymbol{]} \boldsymbol{[}}(X)}} \bigcup _{i \in I} \big (\boldsymbol{A} \cap \boldsymbol{\lambda }(i)\big )\).

  5. 5.

    These definitions are also used in [8], in order to show that the second algebra of complemented subsets is a Boolean semiring with unit.

  6. 6.

    In [4], p. 74, Bishop and Bridges mention that \(\mathfrak {B}_2(X)\) satisfies “all the usual finite algebraic laws that do not involve the operation of set complementation”. In [8], p. 695, Coquand and Palmgren rightly notice that \(\mathfrak {B}_2(X)\) does not satisfy the absorption equalities \((\boldsymbol{A} \wedge \boldsymbol{B}) \vee \boldsymbol{A} = \boldsymbol{A}\) and \((\boldsymbol{A} \vee \boldsymbol{B}) \wedge \boldsymbol{A} = \boldsymbol{A}\).

  7. 7.

    The relation of complemented subsets to Chu categories was noticed by Shulman [25], and it is also studied in [23].

References

  1. Beeson, M.J.: Foundations of Constructive Mathematics, Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer, Heidelberg (1985)

    Book  Google Scholar 

  2. Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  3. Bishop, E., Cheng, H.: Constructive measure theory. Mem. Amer. Math. Soc. 116 (1972)

    Google Scholar 

  4. Bishop, E., Bridges, D.S.: Constructive Analysis. Grundlehren der Mathematischen Wissenschaften. Springer, Heidelberg (1985)

    Google Scholar 

  5. Bridges, D.S., Richman, F.: Varieties of Constructive Mathematics. Cambridge University Press, Cambridge (1987)

    Book  Google Scholar 

  6. Ciraulo, F., Sambin, G.: The overlap algebra of regular opens. J. Pure Appl. Algebra 214(11), 1988–1995 (2010)

    Article  MathSciNet  Google Scholar 

  7. Ciraulo, F., Contente, M.: Overlap algebras: a constructive look at complete Boolean algebras. Log. Methods Comput. Sci. 16(1), 13:1–13:15 (2020)

    Google Scholar 

  8. Coquand, T., Palmgren, E.: Metric Boolean algebras and constructive measure theory. Arch. Math. Logic 41, 687–704 (2002)

    Article  MathSciNet  Google Scholar 

  9. Coquand, T.: Universe of Bishop sets. Manuscript (2017)

    Google Scholar 

  10. Griss, G.F.: Negationless intuitionistic mathematics I. Indag. Math. 8, 675–681 (1946)

    MathSciNet  MATH  Google Scholar 

  11. Kalman, J.A.: Lattices with involution. Trans. Amer. Math. Soc. 87, 485–491 (1958)

    Article  MathSciNet  Google Scholar 

  12. Ledda, A.: Stone-type representations and dualities for varieties of bisemilattices. Stud. Logica. 106(2), 417–448 (2017). https://doi.org/10.1007/s11225-017-9745-9

    Article  MathSciNet  MATH  Google Scholar 

  13. Mines, R., Richman, F., Ruitenburg, W.: A Course in Constructive Algebra. Springer, New York (1988). https://doi.org/10.1007/978-1-4419-8640-5

    Book  MATH  Google Scholar 

  14. Martin-Löf, P.: An intuitionistic theory of types: predicative part. In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium 1973, Proceedings of the Logic Colloquium. Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 73–118. North-Holland (1975)

    Google Scholar 

  15. Martin-Löf, P.: An intuitionistic theory of types. In: Sambin, G., Smith, J.M. (eds.) Twenty-Five Years of Constructive Type Theory (Venice, 1995). Oxford Logic Guides, vo. 36, pp. 127–172. Oxford University Press (1998)

    Google Scholar 

  16. Palmgren, E.: Constructivist and structuralist foundations: Bishop’s and Lawvere’s theories of sets. Ann. Pure Appl. Log. 163, 1384–1399 (2012)

    Article  MathSciNet  Google Scholar 

  17. Palmgren, E., Wilander, O.: Constructing categories and setoids of setoids in type theory. Log. Methods Comput. Sci. 10(3), 25 (2014)

    Article  MathSciNet  Google Scholar 

  18. Palmgren, E.: Constructions of categories of setoids from proof-irrelevant families. Arch. Math. Log. 56, 51–66 (2017)

    Article  MathSciNet  Google Scholar 

  19. Petrakis, I.: Constructive topology of Bishop spaces. Ph.D. Thesis, LMU Munich (2015)

    Google Scholar 

  20. Petrakis, I.: Families of sets in Bishop set theory. Habilitationsschrift, LMU, Munich (2020). https://www.mathematik.uni-muenchen.de/~petrakis/

  21. Petrakis, I.: Embeddings of Bishop spaces. J. Log. Comput. exaa015 (2020). https://doi.org/10.1093/logcom/exaa015

  22. Petrakis, I.: Direct spectra of Bishop spaces and their limits. Log. Methods Comput. Sci. 17(2), 4:1–4:50 (2021)

    Google Scholar 

  23. Petrakis, I.: Chu representations of categories related to constructive mathematics. arXiv:2106.01878v1 (2021)

  24. Petrakis, I.: Bases of pseudocompact Bishop spaces. In: Bridges, D.S., et al. (eds.) Handbook of Constructive Mathematics. Cambridge University Press (2022)

    Google Scholar 

  25. Shulman, M.: Affine logic for constructive mathematics. arXiv:1805.07518v2 (2021)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iosif Petrakis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Petrakis, I., Wessel, D. (2022). Algebras of Complemented Subsets. In: Berger, U., Franklin, J.N.Y., Manea, F., Pauly, A. (eds) Revolutions and Revelations in Computability. CiE 2022. Lecture Notes in Computer Science, vol 13359. Springer, Cham. https://doi.org/10.1007/978-3-031-08740-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-08740-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-08739-4

  • Online ISBN: 978-3-031-08740-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics