English
Related papers

Related papers: Forcing, genericity and CBERS

200 papers

This paper deals with properties of filtrations on vector spaces indexed by partially ordered finitely generated abelian groups, which we call multifiltrations. We discuss the usual properties of filtrations, like exhaustivity and…

Algebraic Geometry · Mathematics 2018-08-31 José Ignacio Burgos Gil , Vivek Mohan Mallick

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

Commutative Algebra · Mathematics 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

The oracle c.c.c. is closely related to Cohen forcing. During an iteration we can ``omit a type''; i.e. preserve ``the intersection of a given family of Borel sets of reals is empty'' provided that Cohen forcing satisfies it. We generalize…

Logic · Mathematics 2007-05-23 Saharon Shelah

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…

Logic · Mathematics 2016-07-07 Peter A. Cholak , Damir D. Dzhafarov , Mariya I. Soskova

We investigate the behavior of countable Borel equivalence relations (CBERs) on topological Ramsey spaces. First, we give a simple proof of the fact that every CBER on $[\mathbb{N}]^{\mathbb{N}}$ is hyperfinite on some set of the form…

Logic · Mathematics 2026-02-10 Balázs Bursics , Zoltán Vidnyánszky

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

We prove that a generic linear cocycle over a minimal base dynamics of finite dimension has the property that the Oseledets splitting with respect to any invariant probability coincides almost everywhere with the finest dominated splitting.…

Dynamical Systems · Mathematics 2013-02-25 Jairo Bochi

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

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

In this paper, the author introduces hyperfields and give some facts about the roots and multiplicities of polynomials over hyperfield based on \cite{2} and \cite{3}. Then he tests the sharpness of an inequality in Baker's former work…

Number Theory · Mathematics 2020-10-20 Ziqi Liu

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…

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 note, we provide an explicit non-Quillen equivalence between the category of precubical sets and Gaucher's category of flows via a class of "realization functors" (with mild assumptions on the cofibrations of the category of…

Category Theory · Mathematics 2020-12-09 Joshua F. Lieber

We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…

Logic · Mathematics 2022-12-06 Jörg Brendle , Francesco Parente

In this paper, we are concerned with the relation between the ordinarity of surfaces of general type and the failure of the BMY inequality in positive characteristic. We consider semistable fibrations $\pi:S \longrightarrow C$ where $S$ is…

Algebraic Geometry · Mathematics 2021-08-11 Sadık Terzi

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

Deep learning models for semantics are generally evaluated using naturalistic corpora. Adversarial methods, in which models are evaluated on new examples with known semantic properties, have begun to reveal that good performance at these…

Computation and Language · Computer Science 2021-07-27 Atticus Geiger , Ignacio Cases , Lauri Karttunen , Chris Potts

We consider a smooth semiflow strongly focusing monotone with respect to a cone of rank k on a Banach space. We obtain its generic dynamics, that is, semiorbits with initial data from an open and dense subset of any bounded open set are…

Dynamical Systems · Mathematics 2023-04-07 Lirui Feng

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini