SearcharxivSearch

arXiv · 2502.10029

Weak Baumgartner axioms and universal spaces

Abstract

If $X$ is a topological space and $\kappa$ is a cardinal then $\mathsf{BA}_\kappa (X)$ is the statement that for each pair $A, B \subseteq X$ of $\kappa$-dense subsets there is an autohomeomorphism $h:X \to X$ mapping $A$ to $B$. In particular $\mathsf{BA}_{\aleph_1} (\mathbb R)$ is equivalent the celebrated Baumgartner axiom on isomorphism types of $\aleph_1$-dense linear orders. In this paper we consider two natural weakenings of $\mathsf{BA}_\kappa (X)$ which we call $\mathsf{BA}^-_\kappa (X)$ and $\mathsf{U}_\kappa (X)$ for arbitrary perfect Polish spaces $X$. We show that the first of these, though properly weaker, entails many of the more striking consequences of $\mathsf{BA}_\kappa (X)$ while the second does not. Nevertheless the second is still independent of $\mathsf{ZFC}$ and we show in particular that it fails in the Cohen and random models. This motivates several new classes of pairs of spaces which are ``very far from being homeomorphic" which we call ``avoiding", ``strongly avoiding", and ``totally avoiding". The paper concludes by studying these classes, particularly in the context of forcing theory, in an attempt to gauge how different weak Baumgartner axioms may be separated.

Explore related subjects

Keep this discovery

BibTeXRIS

Corey Bacal Switzer. 2025-02-14. Weak Baumgartner axioms and universal spaces. https://arxiv.org/abs/2502.10029

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