Related papers: Categories with Dependence and Semantics of Depend…
Every category $\mathcal K$ has a free completion $\mathcal P \mathcal K$ under colimits and a free completion $\Sigma\mathcal K$ under coproducts. A number of properties of $\mathcal K$ transfer to $\mathcal P \mathcal K$ and…
We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…
We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…
The category of contexts underlying a model of Martin-L\"of type theory with Unit-, $\Sigma$-, and $\Pi$-types need not be locally Cartesian closed, but is necessarily a $\pi$-clan. We exploit this $\pi$-clan structure to build the theory…
Modelling concept representation is a foundational problem in the study of cognition and linguistics. This work builds on the confluence of conceptual tools from G\"ardenfors semantic spaces, categorical compositional linguistics, and…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…
We prove that the category of c-spaces with continuous maps is not cartesian closed. As a corollary the category of locally finitary compact spaces with continuous maps is also not cartesian closed.
We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…
We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…
We present an approach to develop folds for nested data types using dependent types. We call such folds $\textit{dependently typed folds}$, they have the following properties. (1) Dependently typed folds are defined by well-founded…
Extriangulated categories axiomatize extension-closed subcategories of triangulated categories. We show that the homotopy category of an exact quasi-category can be equipped with a natural extriangulated structure.
This paper develops a more general theory of sequences of dependent categorical random variables, extending the works of Korzeniowski (2013) and Traylor (2017) that studied first-kind dependency in sequences of Bernoulli and categorical…
In this paper, we present new concepts of Ann-categories, Ann-functors, and a transmission of the structure of categories based on Ann-equivalences. We build Ann-category of Pic-funtors and prove that each Ann-category can be faithfully…
We show that the category of truncated spaces with finite homotopy invariants ($\pi$\=/finite spaces) has many of the features expected of an elementary \oo topos. It should be thought of as the natural higher analogue of the elementary…
This note gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices).
We present two logical systems based on dependent types that are comparable to ZFC, both in terms of simplicity and having natural set theoretic interpretations. Our perspective is that of a mathematician trained in classical logic, but…
In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…