English
Related papers

Related papers: Strongly proper forcing and some problems of Forem…

200 papers

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

Logic · Mathematics 2016-08-23 Nam Trang

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.

Logic · Mathematics 2007-05-23 Matteo Viale

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Logic · Mathematics 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…

Logic in Computer Science · Computer Science 2015-08-04 Paul-André Melliès , Noam Zeilberger

The pure traction problem of elasticity appears frequently in engineering applications, and its complexity stems from the fact that its solution is unique only up to (infinitesimal) rigid body motions. When finite elements are employed to…

Numerical Analysis · Mathematics 2026-02-05 Ahsan Kaleem , Cristian Gebhardt , Ignacio Romero

In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…

Logic · Mathematics 2016-04-05 Mohammad Golshani , Yair Hayut

We show that various derived categories of torsion modules and contramodules over the adic completion of a commutative ring by a weakly proregular ideal are full subcategories of the related derived categories of modules. By the work of…

Category Theory · Mathematics 2016-07-04 Leonid Positselski

We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions. [These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski…

Logic · Mathematics 2007-05-23 Haim Judah , Andrzej Roslanowski

We obtain a complete characterization of \emph{topologically exact patterns} on \emph{triods}. Based on their \emph{rotation number} $\rho$, these \emph{exact patterns} are grouped into three classes: \emph{slow} ($\rho < \frac{1}{3}$),…

Dynamical Systems · Mathematics 2025-12-02 Sourav Bhattacharya

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…

Logic · Mathematics 2019-03-26 Giorgio Venturi

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

Several questions of approximation theory are discussed: 1) can one approximate stably in $L^\infty$ norm $f^\prime$ given approximation $f_\delta, \parallel f_\delta - f \parallel_{L^\infty} < \delta$, of an unknown smooth function $f(x)$,…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. G. Ramm

A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…

Logic · Mathematics 2021-07-01 Ashutosh Kumar , Dilip Raghavan

We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several…

Commutative Algebra · Mathematics 2022-08-25 Gianluca Cassese

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

We present several theorems on strict and strong convexity, and higher order differential formulae for sandwiched quasi-relative entropy (a parametrised version of the classical fidelity). These are crucial for establishing global linear…

Functional Analysis · Mathematics 2018-10-17 Rajendra Bhatia , Tanvi Jain , Yongdo Lim

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

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

This paper is addressed to the well-posedness of some linear and semilinear backward stochastic differential equations with general filtration, without using the Martingale Representation Theorem. The point of our approach is to introduce a…

Probability · Mathematics 2011-04-05 Qi Lu , Xu Zhang

In this paper, using the Bregman distance, we introduce a new projection-type algorithm for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points. Then the strong convergence of the sequence…

Optimization and Control · Mathematics 2021-12-28 Mostafa Ghadampour , Ebrahim Soori , Ravi P. Agarwal , Donal O'Regan