相关论文: On model completion of T_{aut}

The Trotter-Suzuki decomposition is an important tool for the simulation and control of physical systems. We provide evidence for the stability of the Trotter-Suzuki decomposition. We model the error in the decomposition and determine…

In this note, we introduce the notion of support graph to define explanations for any model of a logic program. An explanation is an acyclic support graph that, for each true atom in the model, induces a proof in terms of program rules…

Let us say that a discrete countable group is stable if it has an ergodic, free, probability-measure-preserving and stable action. Let G be a discrete countable group with a central subgroup C. We present a sufficient condition and a…

A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free…

We introduce the {\em $\mu$-topological stability}. This is a type of stability depending on the measure $\mu$ different from the set-valued approach \cite{lm}. We prove that the map $f$ is $m_p$-topologically stable if and only if $p$ is a…

This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…

Robustness guarantees are important properties to be looked for during control design. They ensure stability of closed-loop systems in face of uncertainties, unmodeled effects and bounded disturbances. While the theory on robust stability…

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,…

To foster trust in machine learning models, explanations must be faithful and stable for consistent insights. Existing relevant works rely on the $\ell_p$ distance for stability assessment, which diverges from human perception. Besides,…

The stable reduction theorem says that a family of curves of genus $g\geq 2$ over a punctured curve can be uniquely completed (after possible base change) by inserting certain stable curves at the punctures. We give a new proof of this…

If a finite group acts topologically, faithfully and orientation preservingly on R^3, then it is isomorphic to a subgroup of SO(3).

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…

This paper presents a theoretical, idealized model of the thinking process with the following characteristics: 1) the model can produce complex thought sequences and can be generalized to new inputs, 2) it can receive and maintain input…

A useful sampling-reconstruction model should be stable with respect to different kind of small perturbations, regardless whether they result from jitter, measurement errors, or simply from a small change in the model assumptions. In this…

An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is…

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

The satisfiability problem is NP-complete but there are subclasses where all the instances are satisfiable. For this, restrictions on the shape of the formula are made. Darman and D\"ocker show that the subclass MONOTONE $3$-SAT-($k$,1)…

Given a structure $\mathcal{M}$ and a stably embedded $\emptyset$-definable set $Q$, we prove tameness preservation results when enriching the induced structure on $Q$ by some further structure $\mathcal{Q}$. In particular, we show that if…