Related papers: Algebraic characterisation of pseudo-elementary an…

We notice that for any positive integer $k$, the set of $(1,2)$-specialized characters of level $k$ standard $A_{1}^{(1)}$-modules is the same as the set of rescaled graded dimensions of the subspaces of level $2k+1$ standard…

We consider infinite $\Z_\Z$-index complexes $\mathcal C$ of spaces with elements depending on a number of parameters, complete with respect to a linear associative regular inseparable multilinear product. The existence of nets of vanishing…

Decomposition classes provide a way of partitioning the Lie algebras of an algebraic group into equivalence classes based on the Jordan decomposition. In this paper, we investigate the decomposition classes of the Lie algebras of connected…

We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…

We initiate the representation theory of restricted Lie superalgebras over an algebraically closed field of characteristic p>2. A superalgebra generalization of the celebrated Kac-Weisfeiler Conjecture is formulated, which exhibits a…

Separations among the first order logic ${\cal R}ing(0,+,*)$ of finite residue class rings, its extensions with generalized quantifiers, and in the presence of a built-in order are shown, using algebraic methods from class field theory.…

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author.…

In this expository article, we describe the classification of the subalgebras of the rank 2 semisimple Lie algebras. Their semisimple subalgebras are well-known, and in a recent series of papers, we completed the classification of the…

We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…

The main goal of this paper is to develop the structure theory of Hom-Lie superalgebras in characteristic 2. We discuss their representations, semidirect product, $\alpha^k$-derivations and provide a classification in low dimension. We…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

We consider projective, irreducible, non-singular curves over an algebraically closed field $\k$. A cover $Y \to X$ of such curves corresponds to an extension $\Omega/\Sigma$ of their function fields and yields an isomorphism $\A_{Y} \simeq…

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…