English
Related papers

Related papers: Almost Strong Properness

200 papers

We study the Artin Approximation property with constraints in a different frame. As a consequence we give a nested Artin Strong Approximation property for algebraic power series rings over a field.

Commutative Algebra · Mathematics 2017-05-02 Zunaira Kosar , Dorin Popescu

When uncertainty is modelled by a set of non-dominated and non-compact probability measures, a notion of essential supremum for a family of real-valued functions is developed in terms of upper semi-analytic functions. We show how the…

Mathematical Finance · Quantitative Finance 2024-03-19 Laurence Carassus

In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…

Logic · Mathematics 2024-11-19 Ben De Bondt , Alessandro Vignati

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

Razborov and Rudich have shown that so-called "natural proofs" are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is widely regarded as a serious barrier to proving strong…

Computational Complexity · Computer Science 2009-03-30 Timothy Y. Chow

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

Logic · Mathematics 2008-10-30 Bernhard Irrgang

We prove in significant generality the (almost-)representability of the Picard functor when restricted to smooth test schemes. The novelty lies in the fact that we prove such (almost-)representability beyond the proper setting.

Algebraic Geometry · Mathematics 2025-05-05 Zev Rosengarten

We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…

Logic · Mathematics 2014-11-25 Charles Morgan

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

Logic · Mathematics 2018-01-16 Saharon Shelah

Conditions for Bayesian posterior robustness have been examined in recent literature. However, many of the proofs seem to be long and complicated. In this paper, we first summarize some basic lemmas that have been applied implicitly or…

Statistics Theory · Mathematics 2023-11-06 Yasuyuki Hamura

This study proposes a new efficiency requirement, a minimal almost weak Pareto principle, which says that x is socially better than y whenever the only one individual never prefers y to x, and all the others prefers x to y. Then, I show…

Theoretical Economics · Economics 2025-01-20 Norihito Sakamoto

A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…

Logic · Mathematics 2021-08-11 Sean Cox , Gunter Fuchs

A policy is said to be robust if it maximizes the reward while considering a bad, or even adversarial, model. In this work we formalize two new criteria of robustness to action uncertainty. Specifically, we consider two scenarios in which…

Machine Learning · Computer Science 2019-05-08 Chen Tessler , Yonathan Efroni , Shie Mannor

We work with symmetric inner models of forcing extensions based on strongly compact Prikry forcing to extend some known results.

Logic · Mathematics 2020-09-04 Amitayu Banerjee

Fairness assumptions are a valuable tool when reasoning about systems. In this paper, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative…

Logic in Computer Science · Computer Science 2019-11-15 Rob van Glabbeek , Peter Höfner

Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…

Logic · Mathematics 2019-12-09 Noam Greenberg , Joseph S. Miller , Andre Nies

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

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

Towards combining "compactness" and "hugeness" properties at $\omega_2$, we investigate the relevance of side-conditions forcing. We reduce the upper bound on the consistency strength of the weak Chang's Conjecture at $\omega_2$ using…

Logic · Mathematics 2022-10-24 Monroe Eskew

The "finite intersection property" for bifunctions is introduced and its relationship with generalized monotonicity properties is studied. Some results concerning existence of solution for (quasi-)equilibrium problems are established and…

Optimization and Control · Mathematics 2020-02-13 John Cotrina , Anton Svensson