English
Related papers

Related papers: Stability over a predicate and prime closure

200 papers

We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…

Functional Analysis · Mathematics 2019-02-26 Eduardo Dueñez , José N. Iovino

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

Logic · Mathematics 2020-02-28 Sebastien Vasey

We classify the stability of flat-core $p$-elasticae in $\mathbf{R}^d$ subject to the pinned boundary condition. Together with previous work, this completes the classification of stable pinned $p$-elasticae in $\mathbf{R}^d$ for all…

Analysis of PDEs · Mathematics 2025-08-15 Tatsuya Miura , Kensuke Yoshizawa

We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.

Logic in Computer Science · Computer Science 2023-09-08 Richard Statman , Gilles Dowek

Let R be an affine algebra of dimension n \geq 3 over an algebraically closed field k. Suppose char k =0 or char k =p \geq n. Let g,f_1,...,f_r be a R-regular sequence and A=R[f_1/g,...,f_r/g]. Let P be a projective A-module of rank n-1…

Commutative Algebra · Mathematics 2007-05-23 Manoj Kumar Keshari

Let $A$ be a (not necessarily unital) separable non-elementary simple amenable C*-algebra whose tracial basis may not have finite covering dimension and may not be compact but satisfies certain condition (C). We show that $A$ is ${\cal…

Operator Algebras · Mathematics 2024-01-23 Huaxin Lin

For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…

Logic · Mathematics 2024-03-20 Sergei Artemov

We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…

Logic · Mathematics 2024-10-15 Amador Martin-Pizarro

In a series of papers starting in [Sel01] and culminating in [Sel07], Z. Sela proved that free groups, and more generally torsion-free hyperbolic groups, have a stable first-order theory. The question of the stability of the free product of…

Logic · Mathematics 2009-01-22 Azadeh Neman

The use of available disturbance predictions within a nominal model predictive control formulation is studied. The main challenge that arises is the loss of recursive feasibility and stability guarantees when a persistent disturbance is…

Systems and Control · Computer Science 2018-07-31 Pablo R Baldivieso-Monasterios , Paul A. Trodden

We prove a squeezing/stability theorem for delta-epsilon controlled L-groups when the control map is a fibration on a finite polyhedron. A relation with boundedly-controlled L-groups is also discussed.

Geometric Topology · Mathematics 2009-03-18 Erik K. Pedersen , Masayuki Yamasaki

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz

We investigate reflection of stationary sets in P_kappa lambda and prove a consistency result for the case when lambda is the successor of kappa.

Logic · Mathematics 2007-05-23 Thomas Jech , Saharon Shelah

It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial…

Commutative Algebra · Mathematics 2011-10-12 Shamila Bayati , Jürgen Herzog , Giancarlo Rinaldo

In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…

Logic · Mathematics 2009-05-05 Fairouz Kamareddine , Karim Nour

Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory.…

Logic · Mathematics 2007-05-23 Steven Buechler , Olivier Lessmann

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

Number Theory · Mathematics 2024-10-30 Jhixon Macías

In this paper we introduce a new property for normed algebras. This property which we call it stability, plays a key role in the studying of the theory of almost multiplier maps. In this note we study some of the basic properties of this…

Functional Analysis · Mathematics 2015-09-29 E. Ansari Piri , S. Nouri

We prove in this note a stabilized version of a conjecture on $\A^1$-connectedness. For the stabilized version of this conjecture, we introduce the notion of stable $\A^1$-connectedness, which is can be seen as the stabilization of…

K-Theory and Homology · Mathematics 2012-09-04 Nguyen Le Dang Thi
‹ Prev 1 4 5 6 7 8 10 Next ›