中文
相关论文

相关论文: Towards Martin's Minimum

200 篇论文

We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…

逻辑 · 数学 2021-06-15 Jonathan Schilhan

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

逻辑 · 数学 2015-03-30 Mohammad Golshani

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

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

This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that…

逻辑 · 数学 2013-08-20 Andrzej Roslanowski , Saharon Shelah

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

逻辑 · 数学 2011-10-18 Bernhard Irrgang

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

逻辑 · 数学 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

We prove a lower bound for the Cheeger constant of a cylinder $\Omega\times (0,L)$, where $\Omega$ is an open and bounded set. As a consequence, we obtain existence of minimizers for the shape functional defined as the ratio between the…

偏微分方程分析 · 数学 2024-11-08 Aldo Pratelli , Giorgio Saracco

We prove a finiteness theorem for the class of complete finite volume Riemannian manifolds with pinched negative sectional curvature, fixed fundamental group, and of dimension $>2$. One of the key ingredients is that the fundamental group…

微分几何 · 数学 2007-05-23 Igor Belegradek

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

逻辑 · 数学 2020-08-13 Giorgio Laguzzi

Let $\alpha \in (1/2,1)$ be fixed. We prove that $$ \max_{0 \leq t \leq T} |\zeta(\alpha+it)| \geq \exp\left(\frac{c_\alpha (\log T)^{1-\alpha}}{(\log \log T)^\alpha}\right) $$ for all sufficiently large $T$, where we can choose $c_\alpha =…

数论 · 数学 2015-09-01 Christoph Aistleitner

We discuss some problems posed by Ciesielski. For example we show that, consistently, d_c is a singular cardinal and e_c<d_c. Next we prove that the Martin Axiom for sigma --centered forcing notions implies that for every function f:R^2…

逻辑 · 数学 2016-09-07 Saharon Shelah

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

计算机科学与博弈论 · 计算机科学 2007-05-23 Thierry Cachat

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Leszek Kołodziejczyk , Henryk Michalewski , Cécilia Pradic , Michał Skrzypczak

We consider a new type of obstacle problem in the cylindrical domain $\Omega=D\times (0,1)$ arising from minimization of the functional $$ \int_\Omega \frac{1}{2}|\nabla u|^2+\chi_{\{v>0\}}udx, $$ where $v(x')=\int_0^1 u(x', t) dt $. We…

偏微分方程分析 · 数学 2021-04-07 Hayk Mikayelyan

The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…

逻辑 · 数学 2023-08-24 Shani Cohen , Saharon Shelah

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

逻辑 · 数学 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

For $\alpha, \beta, \delta \in [0,1], \alpha +\beta = 1 $ we consider sets $$ {\rm BAD}^* (\alpha, \beta ;\delta) = \left\{\xi = (\xi_1,\xi_2) \in [0,1]^2: ,\inf_{p\in \mathbb{N}} \max \{(p\log(p+1))^\alpha ||p\xi_1||, (p\log (p+1))^\beta…

数论 · 数学 2008-04-12 Nikolay G. Moshchevitin

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

逻辑 · 数学 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

逻辑 · 数学 2007-05-23 Saharon Shelah

A Hilbert-type axiomatic rejection $\mathbf{HAR}$ for the propositional fragment $\mathbf{L_1}$ of Le\'{s}niewski's ontology is proposed. Also a Gentzen-type axiomatic rejection $\mathbf{GAR}$ of $\mathbf{L_1}$ is proposed. Models for…

逻辑 · 数学 2021-08-19 Takao Inoué , Arata Ishimoto , Mitsunori Kobayashi
‹ 上一页 1 8 9 10 下一页 ›