Related papers: A computational glimpse at the Leibniz and Frege h…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
This paper deals with the classification of Leibniz central extensions of a naturally graded filiform Lie algebra. We choose a basis with respect to that the table of multiplication has a simple form. In low dimensional cases isomorphism…
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…
The Leibniz bracket of an operator on a (graded) algebra is defined and some of its properties are studied. A basic theorem relating the Leibniz bracket of the commutator of two operators to the Leibniz bracket of them, is obtained. Under…
The structure of Lie algebras, Lie superalgebras and Leibniz algebras graded by finite root systems has been studied by several researchers since 1992. In this paper, we study the structure of Leibniz superalgebras graded by finite root…
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…
In this paper we identify the structure of complex finite-dimensional Leibniz algebras with associated Lie algebras $sl_2^1\oplus sl_2^2\oplus \dots \oplus sl_2^s\oplus R,$ where $R$ is a solvable radical. The classifications of such…
We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…
We present the first known solution to the original supertask, the Thomson Lamp Paradox. We also offer preliminary resources for classifying computational complexity of various supertasks. In so doing we consider a newly apparent paradox…
We establish a correspondence between infinity-enhanced Leibniz algebras, recently introduced in order to encode tensor hierarchies, and differential graded Lie algebras, which have been already used in this context. We explain how any…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
Let $\mathfrak{g}$ be a nilpotent Lie algebra which is also regarded as a homogeneous Lie group with the Campbell-Hausdorff multiplication. This allows to define a generalized multiplication $f \# g = (f^{\vee} * g^{\vee})^{\wedge}$ of two…
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 prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…
The calculus of classes and closure operations has proved to be a useful tool in group theory and has led to a deep theory in the study of finite soluble groups. More recently, parallel theories have started to be developed in various…
This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
This paper is devoted to the complete algebraic and geometric classification of complex $5$-dimensional nilpotent binary Leibniz and $4$-dimensional nilpotent mono Leibniz algebras. As a corollary, we have the complete algebraic and…
This paper undertakes a foundational inquiry into logical inferentialism with particular emphasis on the normative standards it establishes and the implications these pose for classical logic. The central question addressed herein is: 'What…