Related papers: On perturbations of continuous structures
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
In this work we pursue the singular-vector analysis of the integrable perturbations of conformal theories that was initiated in hep-th/9603088. Here we consider the detailed study of the N=1 superconformal theory and show that all…
We consider stability theory for Polish spaces and more generally for definable structures (say, with elements of a set of reals). We clarify by proving some equivalent conditions for $\aleph_0$-stability. We succeed to prove existence of…
We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…
We prove that $IHS_A$, the theory of infinite dimensional Hilbert spaces equipped with a generic automorphism, is $\aleph_0$-stable up to perturbation of the automorphism, and admits prime models up to perturbation over any set. Similarly,…
A simple theory for the leading-order correction g_1(r) to the structure of a hard-sphere liquid with discrete (e.g. square-well) potential perturbations is proposed. The theory makes use of a general approximation that effectively…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…
We generalise the correspondence between $\aleph 0$-categorical theories and their automorphism groups to arbitrary complete theories in classical logic, and to some theories (including, in particular, all $\aleph 0$-categorical ones) in…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…
We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than the unit ball approach (which has been the…
We investigate the automorphism groups of $\aleph\_0$-categorical structures and prove that they are exactly the Roelcke precompact Polish groups. We show that the theory of a structure is stable if and only if every Roelcke uniformly…
We consider constrained partial differential equations of hyperbolic type with a small parameter $\varepsilon>0$, which turn parabolic in the limit case, i.e., for $\varepsilon=0$. The well-posedness of the resulting systems is discussed…
Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…
The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We characterize the spectrum (and its parts) of operators which can be represented as G=A+BC for a simpler operator A and a structured perturbation BC. The interest in this kind of perturbations is motivated, e.g., by perturbations of the…