Related papers: The poset of all logics II: Leibniz classes and hi…
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…
In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The main result states that, for logics presented syntactically,…
Leibniz algebras are a non-anticommutative version of Lie algebras. They play an important role in different areas of mathematics and physics and have attracted much attention over the last thirty years. In this paper we investigate whether…
Leibniz algebras are certain generalization of Lie algebras. It is natural to generalize concepts in Lie algebras to Leibniz algebras and investigate whether the corresponding results still hold. In this paper we introduce the notion of…
Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…
A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…
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.…
Leibniz algebras are non-antisymmetric generalizations of Lie algebras that have attracted substantial interest due to their close relation with the latter class. A Leibniz algebra $A$ is called perfect if it coincides with its derived…
In this paper we continue the study of the subalgebra lattice of a Leibniz algebra. In particular, we find out that solvable Leibniz algebras with an upper semi-modular lattice are either almost-abelian or have an abelian ideal spanned by…
Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…
This paper is devoted to the description of complex finite-dimensional algebras of level two. We obtain the classification of algebras of level two in the variety of Leibniz algebras. It is shown that, up to isomorphism, there exist three…
Leibniz algebras are certain generalization of Lie algebras. In this paper we give classification of non-Lie solvable (left) Leibniz algebras of dimension $\leq 8$ with one dimensional derived subalgebra. We use the canonical forms for the…
A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occurs in abstract model theory, institution theory and in algebraic logic. Logic families…
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…
It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…
In this note we present a more detailed and explicit exposition of the definition of a conformal representation of a Leibniz algebra. Recall (arXiv:math/0611501v3) that Leibniz algebras are exactly Lie dialgebras. The idea is based on the…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…
We extend results related to maximal subalgebras and ideals from Lie to Leibniz algebras. In particular, we classify minimal non-elementary Leibniz algebras and Leibniz algebras with a unique maximal ideal. In both cases, there are types of…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…