English
Related papers

Related papers: $\sigma$-continuity and related forcings

200 papers

Deep learning models suffer from the problem of semantic discontinuity: small perturbations in the input space tend to cause semantic-level interference to the model output. We argue that the semantic discontinuity results from these…

Machine Learning · Computer Science 2024-06-18 Shangxi Wu , Dongyuan Lu , Xian Zhao , Lizhang Chen , Jitao Sang

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…

Logic · Mathematics 2012-01-04 Jakob Kellner , Saharon Shelah

In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…

Logic · Mathematics 2018-05-15 Yair Hayut , Asaf Karagila

We study the notion of $\mathcal J$-MAD families where $\mathcal J$ is a Borel ideal on $\omega$. We show that if $\mathcal J$ is an arbitrary $F_\sigma$ ideal, or is any finite or countably iterated Fubini product of $F_\sigma$ ideals,…

Logic · Mathematics 2022-10-07 Karen Bakke Haga , David Schrittesser , Asger Törnquist

We investigate the $\sigma$-porosity of certain known ideals of subsets of natural numbers. Porosity is a notion of smallness in metric spaces that is stronger than nowhere density. Analogously, $\sigma$-porosity is a strengthening of…

Logic · Mathematics 2025-12-09 Paweł Klinga , Andrzej Nowik , Anna Wąsik

We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.

Logic · Mathematics 2014-02-26 Andrzej Roslanowski , Saharon Shelah , Otmar Spinas

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

In this article, we consider iteration principles for contraction, with the goal of identifying properties for contractions that respect conditional beliefs. Therefore, we investigate and evaluate four groups of iteration principles for…

Artificial Intelligence · Computer Science 2022-02-08 Kai Sauerwald , Gabriele Kern-Isberner , Christoph Beierle

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

Combinatorics · Mathematics 2007-05-23 Mahendra Jani , Robert G. Rieper

Heaviness refers to a sequence of partial sums maintaining a certain lower bound and was recently introduced and studied in "Heaviness: and Extension of a Lemma of Y. Peres." After a review of basic properties to familiarize the reader with…

Dynamical Systems · Mathematics 2009-06-23 David Ralston

We study which $\kappa$-distributive forcing notions of size $\kappa$ can be embedded into tree Prikry forcing notions with $\kappa$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the…

Logic · Mathematics 2021-11-17 Tom Benhamou , Moti Gitik , Yair Hayut

In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…

Commutative Algebra · Mathematics 2020-05-25 Tigran Ananyan , Melvin Hochster

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

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

Logic · Mathematics 2025-03-24 Maxwell Levine

Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…

Logic · Mathematics 2026-04-21 Øystein Linnebo

We introduce an invariant, associated to a coherent sheaf over a projective morphism of schemes, which controls when sheaf cohomology can be passed through the given morphism. We then use this invariant to estimate the stability indexes of…

Commutative Algebra · Mathematics 2019-01-15 Sankhaneel Bisui , Huy Tai Ha , Abu Chackalamannil Thomas

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

Logic in Computer Science · Computer Science 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…

Computational Complexity · Computer Science 2010-06-03 Vassilios Gregoriades

Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…

Logic · Mathematics 2023-01-06 Mohammad Golshani , Saharon Shelah