SearcharxivSearch

arXiv · 2512.10854

Noetherian Properties, Large Cardinals, and Independence Around $\aleph_{\omega}$

Abstract

A base of a topological space is called {\em Noetherian } iff it does not contain an infinite strictly $\subseteq$-increasing chain. We show that minimal cardinality of a regular spaces without a Noetherian base is the first strongly inaccessible cardinal, answering a question from the 1980s. We also study the {\em Noetherian type} of a topological space $X$, denoted by $Nt(X)$, defined as the least cardinal $\kappa$ such that $X$ has a base $\mathcal B$ with $|\{B'\in \mathcal B: B\subset B'\}|<\kappa$ for each $B\in \mathcal B$. The behavior of the Noetherian type under the $G_\delta$-modification was investigated by Milovich and Spadaro. A central question, posed by them, is whether the Noetherian type of the $G_{\delta}$-modification of the space $D(2)^{\aleph_\omega}$ is $\omega_1$. This statement, denoted (Nt), is known to be independent of ZFC + GCH: it holds under ``GCH + $\square_{\aleph_\omega}$'', but fails under ``GCH + $(\aleph_{\omega+1}, \aleph_\omega)\to (\aleph_1, \aleph_0)$''. We place this phenomenon in a broader context by identifying similar independence phenomena for several topological and combinatorial principles. These include: (wFN) the weak Freese-Nation property of $[\aleph_{\omega}]^{\omega}$; (SAT) the existence of a saturated MAD family in $[\aleph_{\omega}]^{\omega}$; (HnT) the existence of an ${\omega}$-homogeneous, but not ${\omega}$-transitive permutation group on $\aleph_{\omega}$; and (SPL) the existence of a countably compact, locally countable, and ${\omega}$-fair regular space of cardinality $\aleph_{\omega+1}$. Assuming GCH, we analyze the logical relationships between these principles and show, for example, that SPL implies wFN, which in turn implies both SAT, HnT and Nt, while SAT does not imply Nt.

Explore related subjects

Keep this discovery

BibTeXRIS

Lajos Soukup, Zoltán Szentmiklóssy. 2025-12-11. Noetherian Properties, Large Cardinals, and Independence Around $\aleph_{\omega}$. https://arxiv.org/abs/2512.10854

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