SearcharxivSearch

arXiv · 2104.14263

Stone space partitions indexed by a poset

Abstract

Stone space partitions $\{X_{p}\mid p\in P\}$ satisfying conditions like $\bar{X_{p}}=\bigcup_{q\leqslant p}X_{q}$ for all $p\in P$, where $P$ is a poset or PO system (poset with a distinguished subset), arise naturally in the study both of primitive Boolean algebras and of $\omega$-categorical structures. A key concept for studying such partitions is that of a $p$-trim open set which meets precisely those $X_{q}$ for which $q\geqslant p$; for Stone spaces, this is the topological equivalent of a pseudo-indecomposable set. This paper develops the theory of infinite partitions of Stone spaces indexed by a poset or PO system where the trim sets form a neighbourhood base for the topology. We study the interplay between order properties of the poset/PO system and topological properties of the partition, examine extensions and completions of such partitions, and derive necessary and sufficient conditions on the poset/PO system for the existence of the various types of partition studied. We also identify circumstances in which a second countable Stone space with a trim partition indexed by a given PO system is unique up to homeomorphism, subject to choices on the isolated point structure and boundedness of the partition elements. One corollary of our results is that there is a partition $\{X_{r}\mid r\in[0,1]\}$ of the Cantor set such that $\bar{X_{r}}=\bigcup_{s\leqslant r}X_{s}\text{ for all }r\in[0,1]$.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Apps. 2021-04-29. Stone space partitions indexed by a poset. https://doi.org/10.1007/s00012-023-00816-6

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