Related papers: A type-theoretic definition of lax $(\infty,\infty…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculus'. This lambda-calculus is called modal type theory ---…
We use the terms "$\infty$-categories" and "$\infty$-functors" to mean the objects and morphisms in an "$\infty$-cosmos." Quasi-categories, Segal categories, complete Segal spaces, naturally marked simplicial sets, iterated complete Segal…
We introduce basic notions in category theory to type theorists, including comprehension categories, categories with attributes, contextual categories, type categories, and categories with families along with additional discussions that are…
We capture in the context of lex colimits, introduced by Garner and Lack, the universal property of the free regular and Barr-exact completions of a weakly lex category. This is done by introducing a notion of flatness for functors…
We study a metric-like structure on categories, showing that the concept of the limit of a sequence in a metric space and the concept of the colimit of a sequence in a category have a common generalization. The main concept is a norm on a…
In this paper we study a new topological invariant $\Cat(X,\xi)$, where $X$ is a finite polyhedron and $\xi\in H^1(X;\R)$ is a real cohomology class. $\Cat(X,\xi)$ is defined using open covers of $X$ with certain geometric properties; it is…
Improvements in language models' capabilities have pushed their applications towards longer contexts, making long-context evaluation and development an active research area. However, many disparate use-cases are grouped together under the…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Generalized contextuality refers to our inability of explaining measurement statistics using a context-independent probabilistic and ontological model. On the other hand, measurement statistics can also be modeled using the framework of…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
We investigate the properties of lax comma categories over a base category $X$, focusing on topologicity, extensivity, cartesian closedness, and descent. We establish that the forgetful functor from $\mathsf{Cat}//X$ to $\mathsf{Cat}$ is…
The type-theoretic modelling of DRT that [degroote06] proposed features continuations for the management of the context in which a clause has to be interpreted. This approach, while keeping the standard definitions of quantifier scope,…
Lusternik-Schnirelmann category (LS-category) of a topological space is the least integer $n$ such that there is a covering of $X$ by $n+1$ open sets, each of them being contractible in $X$. The cone length is the minimum number of…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We introduce a notion of (co)presheaf on a lax double functor $X$, which we generally call an instance. In the terminology of double-categorical logic, a lax double functor valued in sets, possibly preserving finite products, is called a…
This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…
In this paper we formalize some foundation concepts and theorems of group theory in a variant of type theory called the Calculus of Constructions with Definitions. In this theory we introduce definition of a group, which is both general and…