Related papers: A Formal Logic for Formal Category Theory (Extende…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
We prove that the category of models of any relational Horn theory satisfying a mild syntactic condition is infinitely extensive. Central examples of such categories include the categories of preordered sets and partially ordered sets, and…
Denotational models of type theory, such as set-theoretic, domain-theoretic, or category-theoretic models use (actual) infinite sets of objects in one way or another. The potential infinite, seen as an extensible finite, requires a dynamic…
We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…
Given a pair of pseudo double categories $\mathbb A$ and $\mathbb B$, the lax functors from $\mathbb A$ to $\mathbb B$, along with their transformations, modules, and multimodulations, assemble into a virtual double category…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
These notes were originally developed as lecture notes for a category theory course. They should be well-suited to anyone that wants to learn category theory from scratch and has a scientific mind. There is no need to know advanced…
Category theory provides an alternative to Hilbert's Formal Axiomatic method and goes beyond Mathematical Structuralism
Yoneda'e Lemma is about the canonical isomorphism of all the natural transformations from a given representable covariant (contravariant, reps.) functor (from a locally small category to the category of sets) to a covariant (contravariant,…
In this note we show how two fundamental results in Topos theory follow by repeated use of Yoneda's Lemma, the formalism of natural transformations and very basic category theory. In Lemma 9.4, we show the fundamental result SGA4 EXPOSE IV…
The purpose of this work is to complete the algebraic foundations of second-order languages from the viewpoint of categorical algebra as developed by Lawvere. To this end, this paper introduces the notion of second-order algebraic theory…
We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…
We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…
We prove that the stable category associated with the category $\mathsf{PreOrd}(\mathbb C)$ of internal preorders in a pretopos $\mathbb C$ satisfies a universal property. The canonical functor from $\mathsf{PreOrd}(\mathbb C)$ to the…
In this paper, we develop the proof theory of skew prounital closed categories. These are variants of the skew closed categories of Street where the unit is not represented. Skew closed categories in turn are a weakening of the closed…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…
We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…