Search arXivSearch

arXiv · 1803.03862

The Rudin-Kisler ordering of P-points under $\mathfrak{b} = \mathfrak{c}$

Abstract

M. E. Rudin proved under CH that for each P-point there exists another P-point strictly RK-greater (M. E. Rudin, Partial orders on the types of $β\mathbb{N}$ , Trans. Amer. Math. Soc., 155 (1971), 353-362). Assuming $\mathfrak{p}=\mathfrak{c}$ A. Blass showed the same, and proved that each RK-increasing $ω$-sequence of P-points is upper bounded by a P-point, and that there is an order embedding of the real line into the class of P-points with respect to the RK-(pre)ordering (A. Blass, Rudin - Keisler ordering on P-points, Trans. Amer. Math. Soc., 179 (1973), 145-166). In the present paper the results cited above are proved under a (weaker) assumption $\mathfrak{b}=\mathfrak{c}$. A. Blass also asked in (A. Blass, Rudin - Keisler ordering on P-points, Trans. Amer. Math. Soc., 179 (1973), 145-166) what ordinals can be embedded in the set of P-points and pointed out, that such an ordinal may not be greater then $\mathfrak{c}^+$. In the present paper the question is answered showing (under $\mathfrak{b} = \mathfrak{c}$) that there is an order embedding of $\mathfrak{c}^+$ into P-points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrzej Starosolski. 2020-03-24. The Rudin-Kisler ordering of P-points under $\mathfrak{b} = \mathfrak{c}$. https://arxiv.org/abs/1803.03862

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

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO