Related papers: A computational glimpse at the Leibniz and Frege h…
We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…
This paper is devoted to the complete algebraic and geometric classification of complex $5$-dimensional nilpotent Leibniz algebras. In particular, the variety of complex $5$-dimensional nilpotent Leibniz algebras has dimension $24$ it has…
This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means of finite Hilbert calculi. On the side of negative…
Using the free graded Lie algebras we introduce a natural subcomlex of the Loday's complex of a Leibniz algebra. Our conjecture says, that for free Leibniz algebras, the complex is acyclic.
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…
Several open problems in algebraic logic are solved.
We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…
In this paper we investigate pre-derivations of filiform Leibniz algebras. Recall that the set of filiform Leibniz algebras of fixed dimension can be decomposed into three non-intersected families. We describe the pre-derivation of filiform…
In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded…
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $\mathbf{InfEx}_{\cong}$, consisting of the…
We derive explicit formulae for the subalgebra zeta functions of all higher Heisenberg Lie algebras over an arbitrary compact discrete valuation ring $\mathfrak{o}$. To this end, we develop Hecke-theoretic techniques for the enumeration, by…
The Leibniz algebras appeared as a generalization of the Lie algebras. In this work we deal with the classification of nilpotent complex Leibniz algebras of low dimensions. Namely, the classification of nilpotent complex Leibniz algebras…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
In this paper we study some fragments without implications of the (Hilbert) full Lambek logic $\mathbf{HFL}$ and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an…
The so called quantized algebras of functions on affine Hecke algebras of type A and the corresponding q-Schur algebras are defined and their irreducible unitarizable representations are classified.
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
In this article, we present an integration of any real finite-dimensional Leibniz algebra as a Lie rack which reduces in the particular case of a Lie algebra to the ordinary connected simply connected Lie group. The construction is not…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…