English
Related papers

Related papers: Stability over a predicate and prime closure

200 papers

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

Suppose that $\lambda=\lambda^{<\lambda} \ge\aleph_0$, and we are considering a theory $T$. We give a criterion on $T$ which is sufficient for the consistent existence of $\lambda^{++}$ universal models of $T$ of size $\lambda^+$ for models…

Logic · Mathematics 2009-09-25 Mirna Džamonja , Saharon Shelah

We consider a transmission problem where a structurally damped plate equation is coupled with a damped or undamped wave equation by transmission conditions. We show that exponential stability holds in the damped-damped situation and…

Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…

Systems and Control · Computer Science 2016-05-13 Matthias Lorenzen , Fabrizio Dabbene , Roberto Tempo , Frank Allgöwer

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

For a partition {\lambda} and a prime p, we prove a necessary and sufficient condition for there exists a composition {\delta} such that {\delta} can be obtained from {\lambda} after rearrangement and all the partial sums of {\delta} are…

Representation Theory · Mathematics 2020-03-17 Kay Jin Lim , Jialin Wang

Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…

Combinatorics · Mathematics 2018-08-22 Jeff Kahn , Jinyoung Park

We show that the local-global divisibility in commutative algebraic groups defined over number fields can be tested on sets of primes of arbitrary small density, i.e. stable and persistent sets. We also give a new description of the…

Number Theory · Mathematics 2023-09-08 Alexander B. Ivanov , Laura Paladino

The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…

Algebraic Geometry · Mathematics 2013-03-01 Sudarshan Gurjar

We prove a new kind of homological stability theorem for automorphism groups of finitely-generated projective modules over Dedekind domains, which takes into account all possible stabilisation maps between these, rather than only…

Commutative Algebra · Mathematics 2024-05-14 Oscar Randal-Williams

We prove existence and uniqueness of solutions, continuous dependence from the initial datum and stability with respect to the boundary condition in a class of initial--boundary value problems for systems of balance laws. The particular…

Analysis of PDEs · Mathematics 2014-03-27 Mauro Garavello , Rinaldo M. Colombo

Let $L$ be any finite distributive lattice and $B$ be any boolean predicate defined on $L$ such that the set of elements satisfying $B$ is a sublattice of $L$. Consider any subset $M$ of $L$ of size $k$ of elements of $L$ that satisfy $B$.…

Discrete Mathematics · Computer Science 2020-01-10 Vijay K. Garg

A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…

Logic in Computer Science · Computer Science 2007-05-23 Alexei Lisitsa , Igor Potapov

There are classical theorems of analysis which, given certain conditions on a perturbation, assert stability of the essential and absolutely continuous components of the spectrum of a self-adjoint operator. Whereas the singular component is…

Spectral Theory · Mathematics 2021-10-27 Nurulla Azamov

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…

Logic · Mathematics 2009-05-05 Karim Nour , Khelifa Saber

In this paper, we will prove a very general result of stability for perturbations of linear integrable Hamiltonian systems, and we will construct an example of instability showing that both our result and our example are optimal. Moreover,…

Dynamical Systems · Mathematics 2015-05-28 Abed Bounemoura

The paper deals with initial-boundary value problems for linear non-autonomous first order hyperbolic systems whose solutions stabilize to zero in a finite time. We prove that problems in this class remain exponentially stable in $L^2$ as…

Analysis of PDEs · Mathematics 2025-12-10 I. Kmit , N. Lyul'ko

We deal with the systematic development of stability for the context of approximate elementary submodels of a monster metric space, which is not far, but still very distinct from the first order case. In particular we prove the analogue of…

Logic · Mathematics 2007-05-23 Saharon Shelah , Alex Usvyatsov

For an $\aleph_1$-categorical atomic class, we clarify the space of types over the unique model of size $\aleph_1$. Using these results, we prove that if such a class has a model of size $\beth_1^+$ then it is $\omega$-stable.

Logic · Mathematics 2024-08-14 John T. Baldwin , M. C. Laskowski , Saharon Shelah

We study classes of atomic models At_T of a countable, complete first-order theory T . We prove that if At_T is not pcl-small, i.e., there is an atomic model N that realizes uncountably many types over pcl(a) for some finite tuple a from N,…

Logic · Mathematics 2017-01-20 Michael C. Laskowski , Saharon Shelah