English
Related papers

Related papers: Simple forcing notions and forcing axioms

200 papers

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

Logic · Mathematics 2016-09-07 Saharon Shelah

We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…

Logic · Mathematics 2017-12-22 Marc Bezem , Ulrik Buchholtz , Thierry Coquand

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

Logic · Mathematics 2013-01-03 Andrzej Roslanowski , Saharon Shelah

We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…

Logic · Mathematics 2021-10-25 Philipp Schlicht , Christopher Turner

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

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 meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Despite its apparent complexity, our world seems to be governed by simple laws of physics. This volume provides a philosophical introduction to such laws. I explain how they are connected to some of the central issues in philosophy, such as…

History and Philosophy of Physics · Physics 2023-09-08 Eddy Keming Chen

We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in…

Logic in Computer Science · Computer Science 2011-03-18 Claudio Sacerdoti Coen , Enrico Tassi

This thesis is concerned with investigations into the "complexity of term rewriting systems". Moreover the majority of the presented work deals with the "automation" of such a complexity analysis. The aim of this introduction is to present…

Logic in Computer Science · Computer Science 2009-12-30 Georg Moser

Reinforcement learning defines the problem facing agents that learn to make good decisions through action and observation alone. To be effective problem solvers, such agents must efficiently explore vast worlds, assign credit from delayed…

Machine Learning · Computer Science 2022-03-02 David Abel

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…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Zero factorial, defined to be one, is often counterintuitive to students but nonetheless an interesting concept to convey in a classroom environment. The challenge is to delineate the concept in a simple and effective way through the…

History and Overview · Mathematics 2024-06-19 Munir Mahmood , Lori L. Murray , Ricardas Zitikis , Ibtihal Mahmood

These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of Turin in the academic year 2011-2012. Our purpose is to give a brief account on forcing axioms with a special…

Logic · Mathematics 2014-12-25 Giorgio Audrito , Gemma Carotenuto

Possible models of modified gravity are being extensively studied now, with most phenomenological motivations coming from puzzles and tensions in cosmology due to a natural desire to better fit the known and newly coming data. At the same…

General Relativity and Quantum Cosmology · Physics 2024-02-06 Alexey Golovnev , Maria-Jose Guzman

We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an…

Logic · Mathematics 2014-02-27 Joel David Hamkins , Thomas A. Johnstone

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.

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

Logic · Mathematics 2021-01-11 David Aspero , Matteo Viale