Related papers: A computational glimpse at the Leibniz and Frege h…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
The paper concerns the classification problem of a subclass of complex filiform Leibniz algebras in dimensions 7 and 8. This subclass arises from naturally graded filiform Lie algebras. We give a complete list of isomorphism classes of…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
In this paper solvable Leibniz algebras whose nilradical is quasi-filiform Lie algebra of maximum length, are classified. The rigidity of such Leibniz algebras with two-dimensional complemented space to nilradical is proved.
We show that for fields that are of characteristic 0 or algebraically closed of characteristic greater than 5, that certain classes of Leibniz algebras are 2-recognizeable. These classes are solvable, strongly solvable and super solvable.…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
Leibniz algebras are certain generalization of Lie algebras. In this paper we give the classification of $5-$dimensional complex non-Lie nilpotent Leibniz algebras. We use the canonical forms for the congruence classes of matrices of…
A general procedure of affinization of linear algebra structures is illustrated by the case of Leibniz algebras. Specifically, the definition of an affine Leibniz bracket, that is, a bi-affine operation on an affine space that at each…
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…
In this paper we focus on algebraic aspects of contractions of Lie and Leibniz algebras. The rigidity of algebras plays an important role in the study of their varieties. The rigid algebras generate the irreducible components of this…
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…
We classify up to equivalence the gradings on Hurwitz superalgebras and on symmetric composition superalgebras, over any field. Also, classifications up to isomorphism are given in case the field is algebraically closed. By grading, here we…
In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…
We review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…
We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…
We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…
We classify all nonnilpotent, solvable Leibniz algebras with the property that all proper subalgebras are nilpotent. This generalizes the work of Stitzinger and Towers in Lie algebras. We show several examples which illustrate the…
While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…