Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0906.5146

On the existence of Stone-Cech compactification

Giovanni Curi
View original source ↗Read source document ↗Export metadata ↓

Abstract

In [G. Curi, "Exact approximations to Stone-Cech compactification'', Ann. Pure Appl. Logic, 146, 2-3, 2007, pp. 103-123] a characterization is obtained of the locales of which the Stone-Cech compactification can be defined in constructive type theory CTT, and in the formal system CZF+uREA+DC, a natural extension of Aczel's system for constructive set theory CZF by a strengthening of the Regular Extension Axiom REA and the principle of dependent choice. In this paper I show that this characterization continues to hold over the standard system CZF plus REA, thus removing in particular any dependency from a choice principle. This will follow by a result of independent interest, namely the proof that the class of continuous mappings from a compact regular locale X to a regular a set-presented locale Y is a set in CZF, even without REA. It is then shown that the existence of Stone-Cech compactification of a non-degenerate Boolean locale is independent of the axioms of CZF (+REA), so that the obtained characterization characterizes a proper subcollection of the collection of all locales. The same also holds for several, even impredicative, extensions of CZF+REA, as well as for CTT. This is in contrast with what happens in the context of Higher-order Heyting arithmetic HHA - and thus in any topos-theoretic universe: by constructions of Johnstone, Banaschewski and Mulvey, within HHA Stone-Cech compactification can be defined for every locale.

Explore related subjects

math.LOmath.GN

Keep this discovery

BibTeXRIS

Giovanni Curi. 2010-01-12. On the existence of Stone-Cech compactification. https://arxiv.org/abs/0906.5146

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↗