Related papers: On Berry's conjectures about the stable order in P…
Representation stability is a theory describing a way in which a sequence of representations of different groups is related, and essentially contains a finite amount of information. Starting with Church-Ellenberg-Farb's theory of…
We present a type system for an extension of lambda calculus with a conditional construction, named STAB, that characterizes the PSPACE class. This system is obtained by extending STA, a type assignment for lambda-calculus inspired by…
One of the basic properties of a queueing network is stability. Roughly speaking, it is the property that the total number of jobs in the network remains bounded as a function of time. One of the key questions related to the stability issue…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
As a generalization of integer-order calculus, fractional calculus has seen tremendous applications in the past few years especially in the description of anomalous viscoelastic properties, transport processes in complex media as well as in…
We analyze the stability under time evolution of complexifier coherent states (CCS) in one-dimensional mechanical systems. A system of coherent states is called stable if it evolves into another coherent state. It turns out that a system…
We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse…
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax…
This is a preliminary study for bifurcation in fractional order dynamical systems. Stability, persistence and hopf bifurcation are studied. Some studies are also done for functional equations.
Motivated by biochemical reaction networks, a generalization of the classical secant condition for the stability analysis of cyclic interconnected commensurate fractional-order systems is provided. The main result presents a sufficient…
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…
Caputo fractional (with power-law kernels) and fractional (delta) difference maps belong to a more widely defined class of generalized fractional maps, which are discrete convolutions with some power-law-like functions. The conditions of…
Cirquent calculus is a new proof-theoretic and semantic approach introduced by G.Japaridze for the needs of his theory of computability logic. The earlier article "From formulas to cirquents in computability logic" by Japaridze generalized…
We study differential graded operads and $p$-adic stable homotopy theory. We first construct a new class of differential graded operads, which we call the stable operads. These operads are, in a particular sense, stabilizations of…
The notion of linear stability of a variety in projective space was introduced by Mumford in the context of GIT. It has subsequently been applied by Mistretta and others to Butler's conjecture on stability of the dual span bundle (DSB)…
The steady states of dynamical processes can exhibit stable nontrivial phases, which can also serve as fault-tolerant classical or quantum memories. For Markovian quantum (classical) dynamics, these steady states are extremal eigenvectors…
Answer set programming is one of the most praised frameworks for declarative programming in general and non-monotonic reasoning in particular. There has been many efforts to extend stable model semantics so that answer set programs can use…
Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…
In this paper we propose a method to define the range of stability of fixed points for a variety of discrete fractional systems of the order $0 < \alpha <2$. The method is tested on various forms of fractional generalizations of the…
We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have…