SearcharxivSearch

arXiv · 2608.03679

The pairwise Stone space of an S4 De Morgan algebra

Abstract

The purpose of this study is to investigate the bitopological duality theory of De Morgan algebras equipped with a closure operator, known as S4 De Morgan algebras. We first introduce certain expansions of pairwise Stone spaces, which we call pairwise S4 De Morgan Stone spaces (henceforth, PS4D-spaces). These consist of a pairwise Stone space $X$ equipped with a twist continuous involution $g\colon X\to X$, as well as a binary relation $R\subseteq X\times X$ that is reflexive and transitive. We first demonstrate that the bitopological spectrum $S_0(A)$ of prime filters of an S4 De Morgan algebra $A$ gives rise to a PS4D-space. A topological representation is then obtained by exhibiting an isomorphism from $A$ to the S4 De Morgan algebra $A_0(S_0(A))$ of $(\tau_1,\delta_2)$-biclopen subsets of $S_0(A)$ whose operation of De Morgan involution is defined through $g$ and whose closure operator is defined through $R$. We then provide an algebraic realization theorem by showing that every PS4D-space $X$ is bihomeomorphic and relationally isomorphic to the bitopological spectrum $S_0(A_0(X))$ of prime filters of $A_0(X)$. With the introduction of suitable bicontinuous frame morphisms, we show that the category $\mathbf{S4D}$ of S4 De Morgan algebras is dually equivalent to the category $\mathbf{PStone_{S4D}}$ of PS4D-spaces. As an application, we provide bitopological characterizations of filters and ideals in general De Morgan algebras under our established duality as well as bitopological soundness and completeness results for an S4-type modal extension of the calculus FDE of first-degree entailment.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph McDonald, Filip Jankovec. 2026-08-04. The pairwise Stone space of an S4 De Morgan algebra. https://arxiv.org/abs/2608.03679

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

KEEP EXPLORING

Related papers

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

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

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