English
Related papers

Related papers: Cohen Preservation and Independence

200 papers

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

Logic · Mathematics 2023-02-13 Joerg Brendle

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information of which instances…

Logic · Mathematics 2019-10-09 Federico Aschieri , Stefan Hetzl , Daniel Weller

Several perturbation tools are established in the volume preserving setting allowing for the pasting, extension, localized smoothing and local linearization of vector fields. The pasting and local linearization hold in all classes of…

Dynamical Systems · Mathematics 2020-04-08 Pedro Teixeira

In this note, we prove a result on the independence of $\ell$ for the supports of irreducible perverse sheaves occurring in the Decomposition Theorem, as well as for the family of local systems on each support. It generalizes Gabber's…

Algebraic Geometry · Mathematics 2018-08-16 Shenghao Sun

Split conformal prediction provides finite-sample marginal coverage under exchangeability, but this guarantee averages over the random calibration sample. We study instead the law of the calibration-conditional coverage induced by a…

Machine Learning · Statistics 2026-05-20 Thiago R. Ramos , Helton Graziadei , Luben M. C. Cabezas

For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…

Spectral Theory · Mathematics 2025-07-10 Alexandru Chirvasitu , Ilja Gogić , Mateo Tomašević

I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to…

Logic · Mathematics 2017-05-02 Kaethe Minden

We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…

Logic · Mathematics 2007-05-23 Deirdre Haskell , Ehud Hrushovski , Dugald Macpherson

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

Logic · Mathematics 2021-07-16 Bagaria Joan , Poveda Alejandro

We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…

Logic · Mathematics 2023-05-30 Itay Kaplan , Nicholas Ramsey , Pierre Simon

The compact finite difference method is a powerful tool for discretizing conservation laws, owing to its inherent flexibility in developing high-resolution and highly stable schemes. In this paper, we propose a framework for the design of…

Numerical Analysis · Mathematics 2026-03-30 Weifeng Hou , Zhangpeng Sun , Wenqi Yao , Liupeng Wang

Let $K/\mathbb{Q}$ be a finitely generated field of characteristic zero and $X/K$ a smooth projective variety. Fix $q\in\mathbb{N}$. For every prime number $\ell$ let $\rho_\ell$ be the representation of $\mathrm{Gal}(K)$ on the \'etale…

Algebraic Geometry · Mathematics 2017-01-18 Sebastian Petersen

We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.

Logic · Mathematics 2019-05-10 Asaf Karagila

We show that many nice properties of a theory $T$ follow from the corresponding properties of its reducts to finite subsignatures. If $\{ T_i \}_{i \in I}$ is a directed family of conservative expansions of first-order theories and each…

Logic · Mathematics 2015-08-26 Alice Medvedev

This note recalls the representation of regular theories T in terms of set-valued functors on models given by Makkai(1990), and explicitly states the representation theorem for the classifying topos Set[T] in terms of filtered colimit…

Category Theory · Mathematics 2013-07-01 Henrik Forssell

We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a…

Logic in Computer Science · Computer Science 2017-01-11 Frederik Harwath , Lucas Heimberg , Nicole Schweikardt

We prove conservativity results for weak K\H{o}nig's lemma that extend the celebrated result of Harrington (for $\Pi^1_1$-statements) and are somewhat orthogonal to the extension by Simpson, Tanaka and Yamazaki (for statements of the form…

Logic · Mathematics 2024-12-19 Anton Freund , Patrick Uftring

We study whether iterated vector fields (vector fields composed with themselves) are conservative. We give explicit examples of vector fields for which this self-composition preserves conservatism. Notably, this includes gradient vector…

Optimization and Control · Mathematics 2021-11-16 Zachary Charles , Keith Rush

We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…

Group Theory · Mathematics 2014-10-24 Doron Puder , Ori Parzanchevski

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman