Related papers: Toward Isomorphism of Intersection and Union types

A subgroup of a Kac-Moody group is called bounded if it is contained in the intersection of two finite type parabolic subgroups of opposite signs. In this paper, we study the isomorphisms between Kac-Moody groups over arbitrary fields of…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

A paraconsistent type theory (an extension of a fragment of intuitionistic type theory by adding opposite types) is here extended by adding co-function types. It is shown that, in the extended paraconsistent type system, the opposite type…

Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…

Embedding models trained separately on similar data often produce representations that encode stable information but are not directly interchangeable. This lack of interoperability raises challenges in several practical applications, such…

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Let $\mathcal{D}$ be a Hom-finite, Krull-Schmidt, 2-Calabi-Yau triangulated category with a rigid object $R$. Let $\Lambda=\operatorname{End}_{\mathcal{D}}R$ be the endomorphism algebra of $R$. We introduce the notion of mutation of maximal…

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

Combinatorial categories satisfy a stronger form of Yoneda Lemma, namely, the isomorphism type of an object can be recovered by counting the number of homomorphisms from all other objects into it. In this work, we show that this property…

Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…

Let $\Lambda$ be a finite-dimensional associative algebra. The torsion classes of $mod\, \Lambda$ form a lattice under containment, denoted by $tors\, \Lambda$. In this paper, we characterize the cover relations in $tors\, \Lambda$ by…

A new approach to the semantics of identity types in intensional Martin-L\"of type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original…

The border-collision normal form describes the local dynamics in continuous systems with switches when a fixed point intersects a switching surface. For one-dimensional cases where the bifurcation creates or destroys only fixed points and…