Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.20061

Weight, net weight, and elementary submodels

Alan Dow·István Juhász
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this note we prove several theorems that are related to some results and problems from [6]. We answer two of the main problems that were raised in [6]. First we give a ZFC example of a Hausdorff space in $C(\omega_1)$ that has uncountable net weight. Then we prove that after adding any number of Cohen reals to a model of CH, in the extension every regular space in $C(\omega_1)$ has countable net weight. We prove in ZFC that for any regular topology of uncountable weight on $\omega_1$ there is a non-stationary subset that has uncountable weight as well. Moreover, if all final segments of $\omega_1$ have uncountable weight then the assumption of regularity can be dropped. By [6], the analogous statements for the net weight are independent from ZFC. Our proofs of all these results make essential use of elementary submodels.

Explore related subjects

math.LOmath.GN

Keep this discovery

BibTeXRIS

Alan Dow, István Juhász. 2025-03-25. Weight, net weight, and elementary submodels. https://arxiv.org/abs/2503.20061

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↗