Related papers: A computational glimpse at the Leibniz and Frege h…
Lie algebras are an important class of algebras which arise throughout mathematics and physics. We report on the formalisation of Lie algebras in Lean's Mathlib library. Although basic knowledge of Lie theory will benefit the reader, none…
Frege's definition of the real numbers, as envisaged in the second volume of \textit{Grundgesetze der Arithmetik}, is fatally flawed by the inconsistency of Frege's ill-fated \textit{Basic Law V}. We restate Frege's definition in a…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…
In this paper the description of solvable Lie algebras with triangular nilradicals is extended to Leibniz algebras. It is proven that the matrices of the left and right operators on elements of Leibniz algebra have upper triangular forms.…
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…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
From the Levi's Theorem it is known that every finite dimensional Lie algebra over a field of characteristic zero is decomposed into semidirect sum of solvable radical and semisimple subalgebra. Moreover, semisimple part is the direct sum…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
In this expository paper we present an overview of various graphical categorifications of the Heisenberg algebra and its Fock space representation. We begin with a discussion of "weak" categorifications via modules for Hecke algebras and…
We show that the isomorphism class of a two-step solvable Lie poset subalgebra of a semisimple Lie algebra is determined by its dimension. We further establish that all such algebras are absolutely rigid.
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
In this note we point out that the definition of the universal enveloping dialgebra for a Leibniz algebra is consistent with the interpretation of a Leibniz algebra as a generalization not of a Lie algebra, but of the adjoint representation…
We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a…
Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
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 present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…