English
Related papers

Related papers: Almost Strong Properness

200 papers

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…

Optimization and Control · Mathematics 2020-03-02 Tuomo Valkonen

We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…

Logic · Mathematics 2019-07-31 Heike Mildenberger

In this work, we introduce a new Asymptotic Norming Property (ANP) which lies between the strongest and weakest of the existing ones, and obtain isometric characterisations of it. The corresponding w*-ANP turns out to be equivalent on the…

Functional Analysis · Mathematics 2016-09-06 Pradipta Bandyopadhyay , Sudeshna Basu

In this paper we present an example of a simple study of velocity proportional resistance force. Some experimental determinations are presented.

Physics Education · Physics 2007-05-23 Gabriel Murariu

Let $\cF$ be a family of finite loops closed under subloops and factor loops. Then every loop in $\cF$ has the strong Lagrange property if and only if every simple loop in $\cF$ has the weak Lagrange property. We exhibit several such…

Group Theory · Mathematics 2016-09-07 Orin Chein , Michael K. Kinyon , Andrew Rajah , Petr Vojtechovsky

We study the recursion-theoretic complexity of Positive Almost-Sure Termination ($\mathsf{PAST}$) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program…

Programming Languages · Computer Science 2023-10-30 Rupak Majumdar , V. R. Sathiyanarayana

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

In this paper, we analyze the problem of how to adapt the concept of proportionality to situations where several perfectly divisible resources have to be allocated among certain set of agents that have exactly one claim which is used for…

Optimization and Control · Mathematics 2022-02-22 Rick K. Acosta-Vega , Encarnación Algaba , Joaquín Sánchez-Soriano

There are many evaluation strategies for term rewrite systems, but proving termination automatically is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies full termination. We adapt…

Logic in Computer Science · Computer Science 2024-02-13 Jan-Christoph Kassing , Florian Frohn , Jürgen Giesl

We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…

Number Theory · Mathematics 2025-08-18 Piotr Miska , Tom Ward

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 aim of this note is to present some new results concerning "almost everywhere" well-posedness and stability of continuity equations with measure initial data. The proofs of all such results can be found in \cite{amfifrgi}, together with…

Analysis of PDEs · Mathematics 2009-10-20 Luigi Ambrosio , Alessio Figalli

We improve upon Huntington's affine geometry by showing that his independence proofs can be, in some cases, simplified. We carry out a systematic investigation of the strict notion of betweenness that Huntington employs (the three arguments…

Logic · Mathematics 2013-12-17 Jesse Alama

Let $X$ be an inner product space, let $G$ be a group of orthogonal transformations of $X$, and let $R$ be a bounded $G$-stable subset of $X$. We define very weak and very strong regularity for such pairs $(R,G)$ (in the sense of…

Combinatorics · Mathematics 2012-11-16 Alexander Schrijver

Our main goal in this paper is to prove results for Witt vectors in the almost category. We finish with an application to almost purity, in particular offering a new proof for rank one valuation rings.

Commutative Algebra · Mathematics 2023-06-21 Ivan Zelich

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Number Theory · Mathematics 2026-03-03 Tigran Hakobyan

We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.

Logic · Mathematics 2008-08-25 Dov Gabbay , Karl Schlechta

A brief review of the recent experimental verifications of the Casimir force between extended bodies is presented. With modern techniques, it now appears feasible to test the force law with 1% precision; I will address the issues relating…

Quantum Physics · Physics 2007-05-23 S. K. Lamoreaux

As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…

Geometric Topology · Mathematics 2021-11-30 Tetsuya Ito