中文
相关论文

相关论文: Small forcings and Cohen reals

200 篇论文

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

逻辑 · 数学 2009-09-25 Chaz Schlindwein

It was established by Jensen in 1970 that there is a generic extension $L[a]$ of the constructible universe $L$ by a real $a\not\in L$ such that $a$ is $\varDelta^1_3$ in $L[a]$. Jensen's forcing construction has found a number of…

逻辑 · 数学 2023-05-23 Vladimir Kanovei

We study the following problem: given n real arguments a1, ..., an and n real weights w1, ..., wn, under what conditions does the inequality w1 f(a1) + w2 f(a2) + ... + wn f(an) >= 0 hold for all functions f with nonnegative kth derivative…

泛函分析 · 数学 2011-08-29 Zarathustra Brady

Assume that $M$ is a c.t.m. of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, $P\in M$ is the poset adding $\aleph_3$ generic reals and $G$ is $P$-generic over $M$. In $M$ we construct a function between sets of terms in the…

逻辑 · 数学 2019-05-27 Bob A. Dumas

We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet…

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

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

逻辑 · 数学 2016-09-07 Martin Goldstern , Saharon Shelah

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

逻辑 · 数学 2024-04-24 Miloš S. Kurilić

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

逻辑 · 数学 2019-02-20 Mohammad Golshani

Assuming three strongly compact cardinals, it is consistent that \[ \aleph_1 < \mathrm{add}(\mathrm{null}) < \mathrm{cov}(\mathrm{null}) < \mathfrak{b} < \mathfrak{d} < \mathrm{non}(\mathrm{null}) < \mathrm{cof}(\mathrm{null}) <…

逻辑 · 数学 2018-10-01 Jakob Kellner , Anda Ramona Tănasie , Fabio Elio Tonti

Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…

逻辑 · 数学 2007-05-23 Uri Abraham , Saharon Shelah

We prove that every continuum of weight aleph_1 is a continuous image of the Cech-Stone-remainder R^* of the real line. It follows that under CH the remainder of the half line [0,infty) is universal among the continua of weight c ---…

一般拓扑 · 数学 2014-01-15 Alan Dow , Klaas Pieter Hart

The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact…

逻辑 · 数学 2007-05-23 Sakaé Fuchino , Stefan Geschke , Saharon Shelah , Lajos Soukup

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

逻辑 · 数学 2021-09-16 Philipp Lücke , Ioannis Souldatos

We exhibit a forcing for producing a model with no nowhere dense ultrafilters that satisfies the full Sacks Property. By interleaving this forcing with other forcing notions, a model containing a $(2, {\aleph}_{0})$-selective ultrafilter,…

逻辑 · 数学 2024-08-21 Dilip Raghavan , Juris Steprāns

Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…

逻辑 · 数学 2016-09-06 Chaz Schlindwein

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

计算机科学中的逻辑 · 计算机科学 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We force a classification of all the Abelian groups of cardinality at most $2^\mathfrak c$ that admit a countably compact group with a non-trivial convergent sequence. In particular, we answer (consistently) Question 24 of Dikranjan and…

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

逻辑 · 数学 2022-11-15 Asaf Karagila , Noah Schweber

In this paper we give a conjecture for the average number of unramified $G$-extensions of a quadratic field for any finite group $G$. The Cohen-Lenstra heuristics are the specialization of our conjecture to the case that $G$ is abelian of…

数论 · 数学 2019-03-20 Melanie Matchett Wood , Philip Matchett Wood

We show that it is consistent with ZFC that every compact group has a non-Haar-measurable subgroup. In addition, we demonstrate a natural construction, and we conjecture that this construction always produces a non-measurable subgroup of a…

群论 · 数学 2015-03-05 W. R. Brian , M. W. Mislove