Related papers: Formalizing the $\infty$-Categorical Yoneda Lemma
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
We introduce a single-set axiomatisation of cubical $\omega$-categories, including connections and inverses. We justify these axioms by establishing a series of equivalences between the category of single-set cubical $\omega$-categories,…
We define a functor which takes in an $(\infty,1)$-category and outputs an $(\omega,1)$-category, the natural maximally "strict" version of an $(\infty,1)$-category. We do this by modeling $(\infty,1)$-categories as categories enriched in…
We complete the foundational architecture of Algebraic Phase Theory by developing a categorical and $2$-categorical framework for algebraic phases. Building on the structural notions introduced in Papers~I-III, we define phase morphisms,…
Notions and techniques of enriched category theory can be used to study topological structures, like metric spaces, topological spaces and approach spaces, in the context of topological theories. Recently in [D. Hofmann, Injective spaces…
This paper introduces a category theory-based framework to redefine physical computing in light of advancements in quantum computing and non-standard computing systems. By integrating classical definitions within this broader perspective,…
We explore the assignment of norms to $\mathit{\Lambda}$-modules over a finite-dimensional algebra $\mathit{\Lambda}$, resulting in the establishment of normed $\mathit{\Lambda}$-modules. Our primary contribution lies in constructing two…
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…
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 present a full formalization in Martin-L\"of's Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using first-order syntax with one sort of names for both free and bound variables and Stoughton's multiple…
Despite the considerable interest in new dependent type theories, simple type theory (which dates from 1940) is sufficient to formalise serious topics in mathematics. This point is seen by examining formal proofs of a theorem about…
Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…
We introduce two novel complementary notions of the Lefschetz number for a functor from a finite acyclic category to itself and we prove a Lefschetz fixed-object theorem and a Lefschetz fixed-morphism theorem. In order to do so, we use the…
We give structural results about bifibrations of (internal) $(\infty,1)$-categories with internal sums. This includes a higher version of Moens' Theorem, characterizing cartesian bifibrations with extensive aka stable and disjoint internal…
We develop foundations for the category theory of $\infty$-categories parametrized by a base $\infty$-category. Our main contribution is a theory of indexed homotopy limits and colimits, which specializes to a theory of $G$-colimits for $G$…
We provide a foundation for working with homological and homotopical methods in categorical algebra. This involves two mutually complementary components, namely (a) the strategic selection of suitable axiomatic frameworks, some well known…
We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…
We regard a geometric theory classified by a topos as a syntactic presentation for the topos and develop tools for finding such presentations. Extensions of geometric theories, which can add axioms, symbols and sorts, are treated as objects…
Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…