English
Related papers

Related papers: A Syntax for Strictly Associative and Unital $\inf…

200 papers

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

General Mathematics · Mathematics 2025-05-19 Barreto Joaquim Reizi

In this thesis we give an algebraic characterization of the syntax and semantics of simply-typed languages. More precisely, we characterize simply-typed binding syntax equipped with reduction rules via a universal property, namely as the…

Logic in Computer Science · Computer Science 2012-06-21 Benedikt Ahrens

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

Riehl and Shulman introduced simplicial type theory (STT), a variant of homotopy type theory which aimed to study not just homotopy theory, but its fusion with category theory: $(\infty,1)$-category theory. While notoriously technical,…

Logic in Computer Science · Computer Science 2025-12-12 Daniel Gratzer , Jonathan Weinberger , Ulrik Buchholtz

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…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

We explain how to set up the homotopy spectral sequence of a (co)simplicial object in an $\infty$-category, with an emphasis on how to construct the differentials in a model-invariant manner.

Algebraic Topology · Mathematics 2021-10-04 David Blanc , Nicholas Meadows

This paper is the second in a series of two papers about generalizing Quillen's Theorem A to strict $\infty$-categories. In the first one, we presented a proof of this Theorem A of a simplicial nature, direct but somewhat ad hoc. In the…

Algebraic Topology · Mathematics 2020-09-07 Dimitri Ara , Georges Maltsiniotis

We prove the first equivalence between a weak non-algebraic model and a semi-strict algebraic model of $(\infty, n)$-categories. This takes the form of a natural semi-strictification, whereby a weak $(\infty, n)$-category is embedded into a…

Category Theory · Mathematics 2025-07-02 Clémence Chanavat , Amar Hadzihasanovic

We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…

Algebraic Topology · Mathematics 2007-05-23 Halvard Fausk , Daniel C. Isaksen

In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…

Rings and Algebras · Mathematics 2020-05-05 Ilya Zhdanovskiy

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

Category Theory · Mathematics 2015-11-26 Juan Pablo Ramirez

We construct a discrete model of the homotopy theory of $S^1$-spaces. We define a category $\sP$ with objects composed of a simplicial set and a cyclic set along with suitable compatibility data. $\sP$ inherits a model structure from the…

Algebraic Topology · Mathematics 2007-05-23 Andrew J. Blumberg

We adapt the classical framework of algebraic theories to work in the setting of (infinity,1)-categories developed by Joyal and Lurie. This gives a suitable approach for describing highly structured objects from homotopy theory. A central…

Algebraic Topology · Mathematics 2010-11-16 James Cranch

This thesis introduces the idea of two-level type theory, an extension of Martin-L\"of type theory that adds a notion of strict equality as an internal primitive. A type theory with a strict equality alongside the more conventional form of…

Logic in Computer Science · Computer Science 2017-02-17 Paolo Capriotti

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

Logic in Computer Science · Computer Science 2021-02-02 Nicolai Kraus

The goal of this paper is to develop a theory of join and slices for strict $\infty$-categories. To any pair of strict $\infty$-categories, we associate a third one that we call their join. This operation is compatible with the usual join…

Category Theory · Mathematics 2020-09-25 Dimitri Ara , Georges Maltsiniotis

We define a homotopy relation between arrows of a category with weak equivalences, and give a condition under which the quotient by the homotopy relation yields the homotopy category. In the case of the fibrant-cofibrant objects of a model…

Category Theory · Mathematics 2018-04-13 Martin Szyld

This manuscript presents a novel framework that integrates higher-order symmetries and category theory into machine learning. We introduce new mathematical constructs, including hyper-symmetry categories and functorial representations, to…

Machine Learning · Computer Science 2024-09-19 Ronald Katende

We give an algebraic characterization of the syntax and operational semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed syntax with variable binding and equipped with reduction rules via a…

Logic · Mathematics 2023-06-22 Benedikt Ahrens