Related papers: A computational glimpse at the Leibniz and Frege h…
In this paper, we study an impact of Leibniz algebras on the algebraic structure of $\mathbb{N}$-graded vertex algebras. We provide easy ways to characterize indecomposable non-simple $\mathbb{N}$-graded vertex algebras…
Basic arithmetic is the cornerstone of mathematics and computer sciences. In arithmetic, 'division by zero' is an undefined operation and any attempt at extending logic for algebraic division to incorporate division by zero has resulted in…
In this paper we give the complete classification of $5$-dimensional complex solvable symmetric Leibniz algebras.
This paper is concerned with generalising the results for Lie $CT$-algebras to Leibniz algebras. In some cases our results give a generalisation even for the case of a Lie algebra. Results on $A$-algebras are used to show every Leibniz…
We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…
In this paper we give a complete classification of two-step nilpotent Leibniz algebras in terms of Kronecker modules associated with pairs of bilinear forms. In particular, we describe the complex and the real case of the indecomposable…
We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
We classify, up to equivalences, all abelian groups gradings on null-filiform and one-parametric filiform Leibniz algebras. Any grading on a null-filiform Leibniz algebra is toral but there are non-toral gradings on one-parametric filiform…
We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…
The set of pure terms which are typable in the $\lambda$$\Pi$-calculus in a given context is not recursive. So there is no general type inference algorithm for the programming language Elf and, in some cases, some type information has to be…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
From the theory of finite dimensional Lie algebras it is known that every finite dimensional Lie algebra is decomposed into a semidirect sum of semisimple subalgebra and solvable radical. Moreover, due to work of Mal'cev the study of…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…
We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.
The analogue of Hilbert's tenth problem over $\mathbb{Q}$ asks for an algorithm to decide the existence of rational points in algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability…
Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…