Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2103.11387

Topological Representation of Double Boolean Algebras

Prosenjit Howlader·Mohua Banerjee
View original source ↗Read source document ↗Export metadata ↓

Abstract

In formal concept analysis, the collection of protoconcepts of any context forms a double Boolean algebra (dBa) which is fully contextual. Semiconcepts of a context form a pure dBa. The present article is a study on topological representation results for dBas, and in particular, those for fully contextual and pure dBas. In this work, a context on topological spaces (CTS) is considered, and the focus is on a special kind of CTS in which the relation defining the context as well as the converse of the relation are continuous with respect to the topologies. Such CTS are denoted as CTSCR. It is observed that clopen object oriented protoconcepts of a CTSCR form a fully contextual dBa, while clopen object oriented semiconcepts form a pure dBa. Every dBa is shown to be quasi-embeddable into the dBa of clopen object oriented protoconcepts of a particular CTSCR. The quasi-embedding turns into an embedding in case of a contextual dBa, and into an isomorphism, when the dBa is fully contextual. For pure dBas, one obtains an isomorphism with the algebra of clopen object oriented semiconcepts of the CTSCR. Representation of finite dBas and Boolean algebras are also addressed in the process. Abstraction of properties of this CTSCR leads to the definition of Stone contexts. Stone contexts and CTSCR- homeomorphisms are seen to form a category, denoted Scxt. Furthermore, correspondences are observed between dBa isomorphisms and CTSCR-homeomorphisms. This motivates a study of categorical duality of dBas, constituting the second part of the article. Pure dBas and fully contextual dBas along with dBa isomorphisms form categories, denoted PDBA and FCDBA respectively. It is established that PDBA is equivalent to FCDBA, while FCDBA and PDBA are dually equivalent to Scxt.

Explore related subjects

math.LOmath.RA

Keep this discovery

BibTeXRIS

Prosenjit Howlader, Mohua Banerjee. 2021-03-21. Topological Representation of Double Boolean Algebras. https://arxiv.org/abs/2103.11387

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗