中文
相关论文

相关论文: $^*$Forcing

200 篇论文

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

逻辑 · 数学 2026-04-01 Paul B. Larson , Chris Lambie-Hanson

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

逻辑 · 数学 2016-09-07 Jörg Brendle , Benedikt Loewe

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

逻辑 · 数学 2026-04-14 Mirna Džamonja

Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…

逻辑 · 数学 2016-05-10 Mario Carneiro

We present an explicit formula for the $K$-theory of the $C^*$-algebra associated with a relative generalized Boolean dynamical system $(\CB, \CL, \theta, \CI_\af; \CJ)$. In particular, we find concrete generators for the $K_1$-group of…

算子代数 · 数学 2025-09-17 Toke Meier Carlsen , Eun Ji Kang

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

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

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

逻辑 · 数学 2026-04-30 Will Boney

We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…

逻辑 · 数学 2019-07-31 Heike Mildenberger

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

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

There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…

逻辑 · 数学 2021-06-17 Nikolai L. Poliakov , Denis I. Saveliev

Suppose that $P$ is a forcing notion, $L$ is a language (in $V$), $\dot{\tau}$ a $P$-name such that $P\Vdash$ "$\dot{\tau}$ is a countable $L$-structure". In the product $P\times P$, there are names $\dot{\tau_{1}},\dot{\tau_{2}}$ such that…

逻辑 · 数学 2015-04-02 Itay Kaplan , Saharon Shelah

For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…

逻辑 · 数学 2007-05-23 Tapani Hyttinen , Saharon Shelah

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

逻辑 · 数学 2024-12-30 Rahman Mohammadpour , Boban Velickovic

We generically construct a model in which the ${\Pi^1_3}$-uniformization property is true, thus lowering the best known consistency strength from the existence of $M_1^{\#}$ to just $\mathsf{ZFC}$. The forcing construction can be adapted to…

逻辑 · 数学 2022-10-18 Stefan Hoffelner

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

逻辑 · 数学 2023-06-22 David Asperó , Asaf Karagila

$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…

群论 · 数学 2021-04-22 Daniel Herden , Alexandra V. Pasi

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

逻辑 · 数学 2021-09-14 Ur Ya'ar

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

逻辑 · 数学 2007-05-23 Maxim R. Burke , Masaru Kada

Let $\phi:M_n\to B(H)$ be an injective, completely positive contraction with $\V\phi^{-1}:\phi(M_n)\to M_n\V_{cb}\leq1+\delta(\epsilon).$ We show that if either (i) $\phi(M_n)$ is faithful modulo the compact operators or (ii) $\phi(M_n)$…

算子代数 · 数学 2014-02-26 Caleb Eckhardt

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

逻辑 · 数学 2021-12-21 Sittinon Jirattikansakul