English
Related papers

Related papers: Nonproper Products

200 papers

We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.

Logic · Mathematics 2021-04-23 Rahman Mohammadpour

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

Logic · Mathematics 2019-08-06 Yasuo Yoshinobu

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

Logic · Mathematics 2015-03-27 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward

We give new equivalent characterizations for ideals of Borel type. Also, we prove that the regularity of a product of ideals of Borel type is bounded by the sum of the regularities of those ideals.

Commutative Algebra · Mathematics 2024-05-01 Mircea Cimpoeas

We present a simple new method for proving that languages are not regular. We prove the correctness of the method, illustrate the ease of using the method on well-known examples of nonregular languages, and prove two additional theorems on…

Formal Languages and Automata Theory · Computer Science 2020-01-27 Jack H. Lutz , Giora Slutzki

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 introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.

Logic · Mathematics 2015-09-07 Jakob Kellner

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 use Bieri-Strebel invariants to determine when a normal fibre product in the product of two finitely presented groups is finitely presented. We give conditions that imply and in some cases characterize the existence of such finitely…

Group Theory · Mathematics 2013-05-30 Conchita Martínez-Pérez

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

Using forcing with measured creatures we build a universe of set theory in which: (a) every sup-measurable function f:RxR-->R is measurable, and (b) every function f:R-->R is continuous on a non-measurable set. This answers a question of…

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

I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

Logic · Mathematics 2014-06-13 John Krueger

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

Logic · Mathematics 2018-01-16 Saharon Shelah

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

An example of two $\mathbb R$-factorizable groups whose product is not $\mathbb R$-factorizable is constructed. One of these groups is second-countable and the other Lindel\"of to any finite power.

General Topology · Mathematics 2025-06-24 Ol'ga Sipacheva

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

This article introduces a line of investigation into connections between creature forcings and topological Ramsey spaces. Three examples of sets of pure candidates for creature forcings are shown to contain dense subsets which are actually…

Logic · Mathematics 2016-07-20 Natasha Dobrinen

An example of a cocomplete abelian category that is not complete is constructed.

Category Theory · Mathematics 2018-05-29 Jeremy Rickard

Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…

Logic · Mathematics 2025-02-05 Thomas Gilton
‹ Prev 1 2 3 10 Next ›