Related papers: Conceptual Differential Calculus. I: First Order L…
This contribution is the first in a series of three: it reports on the construction of (a fine sheaf of) diffeomorphism invariant Colombeau algebras on open sets of Eucildean space, which completes earlier approaches. Part II and III will…
In this paper we consider successive iterations of the first-order differential operations in space ${\bf R}^3.$
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
We discuss the homological algebra of representation theory of finite dimensional algebras and finite groups. We present various methods for the construction and the study of equivalences of derived categories: local group theory, geometry…
We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…
Logical Neural Networks (LNNs) are a type of architecture which combine a neural network's abilities to learn and systems of formal logic's abilities to perform symbolic reasoning. LLNs provide programmers the ability to implicitly modify…
We obtain a complete classification of all finite-dimensional irreducible modules over classical map superalgebras, provide formulas for their (super)characters and a description of their extension groups. Furthermore, we describe the block…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
We define and investigate separable K-linear categories. We show that such a category C is locally finite and that every left C-module is projective. We apply our main results to characterize separable linear categories that are spanned by…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…
This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular…
We give a self-contained exposition of some mathematical aspects of the Mueller-Stokes formalism. In the first part we review some basic notions of linear algebra and establish a proper notation. In the second part we introduce the…
We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
The definition of the local fractional derivative has been generalised to the orders beyond the critical order. This makes it possible to retain more terms in the local fractional Taylor expansion leading to better approximation. This also…