中文
相关论文

相关论文: Preserving old ([omega]^{aleph_0},supseteq^*) is p…

200 篇论文

We give arguments for and prove the consistency of some internal forcing axioms.

逻辑 · 数学 2009-09-25 Garvin Melles

Combining creature forcing approaches from arXiv:1003.3425 and arXiv:1402.0367, we show that, under CH, there is a proper $\omega^\omega$-bounding poset with $\aleph_2$-cc that forces continuum many pairwise different cardinal…

It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…

逻辑 · 数学 2017-01-20 Saharon Shelah

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

逻辑 · 数学 2019-12-30 Christian Espíndola

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

逻辑 · 数学 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

逻辑 · 数学 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…

计算机科学中的逻辑 · 计算机科学 2014-01-17 Yi Zhou , Yan Zhang

We discuss a conjecture of Wilson that under the proper forcing axiom, $\Theta_0$ of the derived model at $\kappa$ is below $\kappa^+$. We prove the conjecture holds for the old derived model. Assuming mouse capturing in the new derived…

逻辑 · 数学 2025-07-21 Derek Levinson , Nam Trang

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.

逻辑 · 数学 2007-05-23 Matteo Viale

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

逻辑 · 数学 2023-01-03 Mohammad Golshani , Haim Horowitz , Saharon Shelah

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

逻辑 · 数学 2020-03-11 Mohammad Golshani , Saharon Shelah

We show that assuming $\mathsf{ZF}+\mathsf{AD}^+ +$ "$V = \mathrm{L} \bigl(\wp (\mathbb{R})\bigr)$", any poset which increases $\Theta$ does not preserve the truth of $\mathsf{AD}$. We also show that in $\mathsf{ZF} + \mathsf{AD}$, any…

逻辑 · 数学 2023-04-04 Daisuke Ikegami , Nam Trang

Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.

逻辑 · 数学 2007-05-23 Jindrich Zapletal

We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…

逻辑 · 数学 2026-03-17 Maxwell Levine

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…

逻辑 · 数学 2024-11-20 Bokai Yao

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

计算机科学中的逻辑 · 计算机科学 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three…

逻辑 · 数学 2011-05-27 Arnold W. Miller

The Maximality Principle MP is a scheme which states that if a sentence of the language of ZFC is true in some forcing extension V^P, and remains true in any further forcing extension of V^P, then it is true in all forcing extensions of V.…

逻辑 · 数学 2007-05-23 George Leibman

In this paper, we discuss necessary and sufficient explanations for formal argumentation - the question whether and why a certain argument can be accepted (or not) under various extension-based semantics. Given a framework with which…

人工智能 · 计算机科学 2020-11-05 AnneMarie Borg , Floris Bex

Suppose that $T^*$ is an $\omega_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong…

逻辑 · 数学 2020-04-28 John Krueger