Related papers: Injective types in univalent mathematics
We prove that any finite subdirectly irreducible Heyting algebra with involution is quasi-primal, and that injective algebras in the variety generated by a finite subdirectly irreducible Heyting algebra are precisely diagonal subalgebras of…
We present a new game semantics for Martin-L\"of type theory (MLTT), our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families of a novel variant of games, which induces a…
We illustrate the use of the notion of derived recurrences introduced earlier to evaluate the algebraic entropy of self-maps of projective spaces. We in particular give an example, where a complete proof is still awaited, but where…
We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalising the groupoid model of type theory. As an application, we show that countable choice cannot be…
Injectivity of objects with respect to a set $\ch$ of morphisms is an important concept of algebra, model theory and homotopy theory. Here we study the logic of injectivity consequences of $\ch$, by which we understand morphisms $h$ such…
Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…
Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…
We give an explicit characterization of all injective subsets of the model space $l_{\infty}(I)$ for a general set $I$, in terms of inequalities involving $1$-Lipschitz functions. Since the class of all injective metric spaces coincides…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
Irreducible representations of both Leavitt and Cohn path algebras of an arbitrary digraph with coefficients in a commutative field is classified. They are constructed in several ways using both infinite paths on the right as well as direct…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work complements…
In this paper we study injective modules over universal enveloping algebras of finite-dimensional Lie algebras over fields of arbitrary characteristic. Most of our results are dealing with fields of prime characteristic but we also…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
Projectivity and injectivity are fundamental notions in category theory. We consider natural weakenings termed semiprojectivity and semiinjectivity, and study these concepts in different categories. For example, in the category of metric…
Consider a finite-dimensional real vector space equipped with a finite group acting unitarily on it. We address the general problem of constructing Euclidean stable embeddings of the quotient space of orbits. Our approach is based on…
We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…
We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it…