Related papers: Identity Types in Algebraic Model Structures and C…
\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…
This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…
We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…
This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…
In this article, we construct a cofibrantly generated model structure on the category of spaces stratified over a fixed poset, and show that it is Quillen-equivalent to a category of diagrams of simplicial sets. Then, considering all those…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-L\"of Type Theory include Quotient Inductive Types (QITs), which exist as instances of Higher Inductive Types, and functional extensionality,…
In this paper, we introduce a method to construct new categories which look like "cubes", and discuss model structures on the presheaf categories over them. First, we introduce a notion of thin-powered structure on small categories, which…
Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…
After two papers on weak cubical categories and {\it collarable} cospans, respectively, we put things together and construct a {\it weak} cubical category of cubical {\it collared} cospans of topological spaces. We also build a second…
Let k be a commutative ring with unit. We endow the categories of filtered complexes and of bicomplexes of k-modules, with cofibrantly generated model structures, where the class of weak equivalences is given by those morphisms inducing a…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…
Ten years ago, it was shown that nominal techniques can be used to design coalgebraic data types with variable binding, so that alpha-equivalence classes of infinitary terms are directly endowed with a corecursion principle. We introduce…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…