English
Related papers

Related papers: The last forcing standing with diamonds

200 papers

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

We try to redo, improve and continue the non-structure parts in some works on a.e.c., which uses weak diamond, in lambda^+ and lambda^{++} getting better and more results and do what is necessary for the book on a.e.c. Comparing with…

Logic · Mathematics 2008-08-25 Saharon Shelah

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Logic · Mathematics 2024-05-17 Ben Goodman

In this paper we provide a general tool to prove the consistency of $I1(\lambda)$ with various combinatorial properties at $\lambda$ typical at settings with $2^\lambda>\lambda^+$, that does not need a profound knowledge of the forcing…

Logic · Mathematics 2015-10-13 Vincenzo Dimonte , Liuzhen Wu

We introduce and study a family of axioms that closely follows the pattern of parametrized diamonds, studied by Moore, Hru\v{s}\'ak, and D\v{z}amonja in [13]. However, our approach appeals to model theoretic / forcing theoretic notions,…

Logic · Mathematics 2025-03-18 Ziemowit Kostana

G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…

Logic · Mathematics 2019-07-02 Saeed Salehi

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Logic · Mathematics 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Logic · Mathematics 2012-09-07 Brent Cody

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Logic · Mathematics 2020-05-27 Alejandro Poveda , Assaf Rinot , Dima Sinapova

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

Logic · Mathematics 2024-10-24 Miguel A. Cardona , Diego A. Mejía , Andrés F. Uribe-Zapata

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

We prove the consistency of the failure of the weak diamond $\Phi_\lambda$ at strongly inaccessible cardinals. On the other hand, we show that the very weak diamond $\Psi_\lambda$ is equivalent to the statement $2^{<\lambda}<2^\lambda$ and…

Logic · Mathematics 2019-03-12 Omer Ben-Neria , Shimon Garti , Yair Hayut

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…

Logic · Mathematics 2020-04-28 John Krueger

I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…

Logic · Mathematics 2019-12-12 Ur Ya'ar

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…

Logic · Mathematics 2017-01-20 Saharon Shelah

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

Logic · Mathematics 2008-10-30 Bernhard Irrgang

We compare the forcing related properties of a complete Boolean algebra B with the properties of the convergences $\lambda_s$ (the algebraic convergence) and $\lambda_{ls}$ on B generalizing the convergence on the Cantor and Aleksandrov…

General Topology · Mathematics 2018-09-27 Miloš S. Kurilić , Aleksandar Pavlović