Related papers: Injective types in univalent mathematics
We define a simple kind of higher inductive type generalising dependent $W$-types, which we refer to as $W$-types with reductions. Just as dependent $W$-types can be characterised as initial algebras of certain endofunctors (referred to as…
One of the main tools to classify \cst-algebras is the study of its projections and its unitaries. It was proved by Cuntz in \cite{Cu81} that if $A$ is a \textit{purely infinite} simple \cst-algebra, then the kernel of the natural map for…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
An algebra $\mathcal{A}$ of $n\times n$ complex matrices is said to be \textit{idempotent compressible} if $E\mathcal{A}E$ is an algebra for all idempotents $E\in\mathbb{M}_n(\mathbb{C})$. Analogously, $\mathcal{A}$ is said to be…
Let $\mathcal{R}$ be a commutative ring with unity, and let $P$ be a locally finite poset. The aim of the paper is to provide an explicit description of the additive biderivations of the incidence algebra $I(P, \mathcal{R})$. We demonstrate…
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…
We present a rich type system with subtyping for an extension of System F. Our type constructors include sum and product types, universal and existential quantifiers, inductive and coinductive types. The latter two size annotations allowing…
We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…
We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…
Given a surjective ring homomorphism, we study when the induced group homomorphism on unit groups is surjective. To this end, we introduce notions of generalized inverses and units, as well as a class of rings such that the set of closed…
We introduce a concept of approximately invertible elements in non-unital normed algebras which is, on one side, a natural generalization of invertibility when having approximate identities at hand, and, on the other side, it is a direct…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…
Multiple types of inference are available for probabilistic graphical models, e.g., marginal, maximum-a-posteriori, and even marginal maximum-a-posteriori. Which one do researchers mean when they talk about "planning as inference"? There is…
For a fixed finite dimensional algebra $A$, we study representation embeddings of the form $mod(B)\rightarrow mod(A)$. Such an embedding is called homological, if it induces an isomorphism on all Ext-groups and weakly homological, if only…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We show that the term equivalence between MV-algebras and MV-semirings lifts to involutive residuated lattices and a class of semirings called \textit{involutive semirings}. The semiring perspective helps us find a necessary and sufficient…