SearcharxivSearch

arXiv · 2306.01702

Partitions of primitive Boolean spaces

Abstract

A Boolean ring and its Stone space (Boolean space) are primitive if the ring is disjointly generated by its pseudo-indecomposable (PI) elements. Hanf showed that a primitive PI Boolean algebra can be uniquely defined by a structure diagram. In a previous paper we defined trim $P$-partitions of a Stone space, where $P$ is a PO system (poset with a distinguished subset), and showed how they provide a physical representation within the Stone space of these structure diagrams. In this paper we study the class of trim partitions of a fixed primitive Boolean space, which may not be compact, and show how they can be structured as a quasi-ordered set via an appropriate refinement relation. This refinement relation corresponds to a surjective morphism of the associated PO systems, and we establish a quasi-order isomorphism between the class of well-behaved partitions of a primitive space and a class of extended PO systems. We also define rank partitions, which generalise the rank diagrams introduced by Myers, and the ideal completion of a trim $P$-partition, whose underlying PO system is the ideal completion of $P$, and show that rank partitions are just the ideal completions of trim partitions. In the process, we extend a number of existing results regarding primitive Boolean algebras or compact primitive Boolean spaces to locally compact Boolean spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew B. Apps. 2023-06-02. Partitions of primitive Boolean spaces. https://arxiv.org/abs/2306.01702

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