SearcharxivSearch

arXiv · 2401.12539

Saturation of reduced products

Abstract

We study reduced products $M=\prod_n M_n/\mathrm{Fin}$ of countable structures in a countable language associated with the Fr\'echet ideal. We prove that such $M$ is $2^{\aleph_0}$-saturated if its theory is stable and not $\aleph_2$-saturated otherwise (regardless of whether the Continuum Hypothesis holds). This implies that $M$ is isomorphic to an ultrapower (associated with an ultrafilter on $\mathbb N$) if its theory is stable, even if the CH fails. We also improve a result of Farah and Shelah and prove that there is a forcing extension in which such reduced product $M$ is isomorphic to an ultrapower if and only if the theory of $M$ is stable. All of these conclusions apply for reduced products associated with $F_\sigma$ ideals or more general layered ideals. We also prove that a reduced product associated with the asymptotic density zero ideal $\mathcal Z_0$, or any other analytic P-ideal that is not $F_\sigma$, is not even $\aleph_1$-saturated if its theory is unstable.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben De Bondt, Ilijas Farah, Alessandro Vignati. 2024-01-23. Saturation of reduced products. https://arxiv.org/abs/2401.12539

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