Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0612240

The spectrum of characters of ultrafilters on omega

Saharon Shelah
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show the consistency of the set of regular cardinals which are the character of some ultrafilter on omega is not convex. We also deal with the set of pi chi-characters of ultrafilters on omega.

Explore related subjects

math.LOmath.GN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saharon Shelah. 2007-08-15. The spectrum of characters of ultrafilters on omega. https://arxiv.org/abs/math/0612240

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Banach and Kuratowski Theorem and generalized strong sequences

In 1929, Banach and Kuratowski proved under CH a combinatorial theorem, which implies that there is not a non-vanishing $σ$-additive finite measure on $\mathbb{R}$ which is defined for every set of reals. In 2003 Bartoszyński and Halbeisen proved that Banach and Kuratowski theorem is equivalent to the existence of a K-Lusin set of the cardinality continuum an the existence of such sets is independent of $ZFC + \neg CH$. On the other hand in 1965 Efimov introduced the strong sequences method which used to prove some well-known theorems in dyadic spaces. The aim of this paper is to show that all this notions can be generalized, i.e. considered in the generalized Baire space and to show some equivalences among them. Moreover, some applications in the direction of calibres, boundedness and partitions relations are also shown.

math.LO↗
arXiv2026

Diamonds in mice

Let $M$ be a $(0,ω_1+1)$-iterable mouse with no largest cardinal. Let $γ\leqκ$ be uncountable cardinals of $M$, with $κ$ regular in $M$. Then $M$ satisfies $\diamondsuit_{κγ}^+$, and if $κ$ is non-ineffable in $M$ then $M$ satisfies $\diamondsuit_{κκ}^+$. Suppose that either $ω_1^M=ω_1$ or $M$ satisfies "I am $(0,ω_1+1)$-iterable". Let $κ\geqω_1^M$ be a cardinal of $M$. Then $M$ satisfies $\diamondsuit^*_{κω_1^M}$.

math.LO↗
arXiv2026

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO↗