中文
相关论文

相关论文: Reasonable ultrafilters, again

200 篇论文

In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…

逻辑 · 数学 2025-12-18 Sittinon Jirattikansakul , Inbar Oren , Assaf Rinot

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

范畴论 · 数学 2009-05-13 Daniel Litt , Zachary Abel , Scott D. Kominers

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…

逻辑 · 数学 2013-09-12 Brent Cody , Menachem Magidor

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…

逻辑 · 数学 2020-02-25 Saharon Shelah

We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete)…

环与代数 · 数学 2016-09-07 Martin Goldstern , Saharon Shelah

We adjust the notion of finitary filter pair, which was coined for creating and analyzing finitary logics, in such a way that we can treat logics of cardinality $\kappa$, where $\kappa$ is a regular cardinal. The corresponding new notion is…

逻辑 · 数学 2022-02-25 Peter Arndt , Hugo Luiz Mariano , Darllan Conceição Pinto

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

逻辑 · 数学 2018-03-09 Vera Fischer , Daniel T. Soukup

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

逻辑 · 数学 2021-07-16 Bagaria Joan , Poveda Alejandro

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

逻辑 · 数学 2014-06-13 Lorenzo Luperi Baglini

The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…

逻辑 · 数学 2024-10-07 Steffen Lempp , Joseph S. Miller , Andre Nies , Mariya Soskova

We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…

逻辑 · 数学 2007-05-23 Ralf Schindler

Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…

逻辑 · 数学 2021-05-14 Erin Carmody , Victoria Gitman , Miha E. Habič

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

逻辑 · 数学 2013-01-03 Andrzej Roslanowski , Saharon Shelah

Superstrong cardinals are never Laver indestructible. Similarly, almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals, 1-extendible cardinals, 0-extendible cardinals, weakly superstrong…

We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some…

逻辑 · 数学 2015-01-16 Diego Alejandro Mejía

We prove that there exists a nonprincipal ultrafilter $\mathcal U$ on $\mathbb N$ such that for every countable (or separable) structure $B$ in a countable language the quotient map from the reduced product associated with the Fr\'echet…

逻辑 · 数学 2021-04-20 Ilijas Farah

Despite being an established notion in the large cardinal hierarchy, results about Woodin cardinals are sparse in the literature. Here we gather known results about the preservation of Woodin cardinals under certain forcing extensions, as…

逻辑 · 数学 2017-11-09 Stamatis Dimopoulos

The logic L^1_\theta introduced in [Sh:797]; it is the maximal logic below L_theta theta in which a well ordering is not definable. We investigate it for theta a compact cardinal. We prove it satisfies several parallel of classical theorems…

逻辑 · 数学 2021-08-10 Saharon Shelah

We investigate the extent to which ultrapowers by normal measures on $\kappa$ can be correct about powersets $\mathcal{P}(\lambda)$ for $\lambda>\kappa$. We consider two versions of this questions, the capturing property…

逻辑 · 数学 2023-02-28 Miha E. Habič , Radek Honzík