Repository logo
  • English
  • Deutsch
  • Français
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. CRIS
  3. Publication
  4. A Stone Duality for Pure and Trivial Double Boolean Algebras
 

A Stone Duality for Pure and Trivial Double Boolean Algebras

URI
https://arbor.bfh.ch/handle/arbor/45774
Version
Published
Identifiers
10.1007/978-3-032-03364-2_26
Date Issued
2025-09-12
Author(s)
Tenkeu Kembang, Gael
Krebs, Michel  
Kwuida, Léonard  
Temgoua Alomo, Etienne Romuald
Tenkeu Jeufack, Yannick Léa
Editor(s)
Cellier, Peggy
Ganter, Bernhard
Missaoui, Rokia
Type
Conference Paper
Language
English
Subjects

Double Boolean algebr...

Topological space

Boolean space

duality

Abstract
This work provides a topological representation for the class of pure and trivial double Boolean algebras and uses it to show that the category of pure and trivial double Boolean algebras and the category of pure and trivial double Boolean spaces are categorically anti-equivalent.
DOI
https://doi.org/10.24451/dspace/12271
Publisher DOI
10.1007/978-3-032-03364-2_26
Journal or Serie
Lecture Notes in Computer Science
Series/Report No.
15941
ISSN
1611-3349
Publisher URL
https://dl.acm.org/doi/10.1007/978-3-032-03364-2_26
Organization
Wirtschaft  
Conference
Conceptual Knowledge Structures: Second International Joint Conference: CONCEPTS 2025: Proceedings
Publisher
Springer
Submitter
Kwuida, Léonard
Citation apa
Tenkeu Kembang, G., Krebs, M., Kwuida, L., Temgoua Alomo, E. R., & Tenkeu Jeufack, Y. L. (2025). A Stone Duality for Pure and Trivial Double Boolean Algebras. In P. Cellier, B. Ganter, & R. Missaoui (Eds.), Lecture Notes in Computer Science (pp. 408–422). Springer. https://doi.org/10.24451/dspace/12271
File(s)
Loading...
Thumbnail Image

restricted

Name

978-3-032-03364-2_26_dBas (1).pdf

License
Publisher
Version
published
Size

578.47 KB

Format

Adobe PDF

Checksum (MD5)

b3c11a26905bfa81c61d82f31f5945ed

About ARBOR

Built with DSpace-CRIS software - System hosted and mantained by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Our institution