English
Related papers

Related papers: Mathias forcing and combinatorial covering propert…

200 papers

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

Consider $\mathbb{G}$ the progressive enlargement of a filtration $\mathbb{F}$ with a random time $\tau$. Assuming that, in $\mathbb{F}$, the martingale representation property holds, we examine conditions under which the martingale…

Probability · Mathematics 2015-05-18 M. Jeanblanc , S. Song

Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

General Topology · Mathematics 2018-04-06 Tal Orenshtein , Boaz Tsaban

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

Logic · Mathematics 2016-09-06 Garvin Melles

M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…

Rings and Algebras · Mathematics 2023-06-19 Ivan Chajda , Miroslav Kolařík , Helmut Länger

This paper studies homeomorphisms of surfaces isotopic to the identity by means of purely topological methods and Brouwer theory. The main development is a novel theory of orbit forcing using maximal isotopies and transverse foliations.…

Dynamical Systems · Mathematics 2017-11-09 Patrice Le Calvez , Fabio Armando Tal

We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing…

We consider products of sets of reals with a combinatorial structure based on scales parameterized by filters. This kind of sets were intensively investigated in products of spaces with combinatorial covering properties as Hurewicz,…

Combinatorics · Mathematics 2025-03-28 Michał Pawlikowski , Piotr Szewczak , Lyubomyr Zdomskyy

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein

This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…

Logic · Mathematics 2007-05-23 Matteo Viale

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

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

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

Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the interrelations between these properties in ZFC and in the realm…

Logic · Mathematics 2010-11-02 Boaz Tsaban , Lyubomyr Zdomskyy

We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…

Logic · Mathematics 2019-07-31 Heike Mildenberger

Let $M_n(\mathbb{F})$ denote the algebra of $n \times n$ matrices over an algebraically closed field $\mathbb{F}$ of characteristic different from $2$. For $n \ge 2$, we classify all maps $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$…

Rings and Algebras · Mathematics 2025-12-16 Ilja Gogić , Mateo Tomašević

In this paper we extend the notion of ``filtration-consistent nonlinear expectation" (or "${\cal F}$-consistent nonlinear expectation") to the case when it is allowed to be dominated by a $g$-expectation that may have a quadratic growth. We…

Probability · Mathematics 2007-05-23 Ying Hu , Jin Ma , Shige Peng , Song Yao

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.

Logic · Mathematics 2013-04-11 Adam R. Day , Joseph S. Miller