Related papers: On true empty category
Integral categories form a sub-class of pre-abelian categories whose systematic study was initiated by Rump in 2001. In the first part of this article we determine whether several categories of topological and bornological vector spaces are…
A full subcategory of a Grothendieck category is called deconstructible if it consists of all transfinite extensions of some set of objects. This concept provides a handy framework for structure theory and construction of approximations for…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…
A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…
Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…
Extending the theory of systems, we introduce a theory of Lie semialgebra ``pairs'' which parallels the classical theory of Lie algebras, but with a ``null set'' replacing $0$. A selection of examples is given. These Lie pairs comprise two…
We prove that the 2-category of symmetric categorical groups have enough projective and injective objects. This was conjectured by Bourn and Vitale in 2002 and was anounced recently by Fang Huang, Shao-Han Chen, Wei Chen and Zhu-Jun Zheng…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
We develop a bicategorical setup in which one can speak about adjoint 1-morphisms even in the absence of genuine identity 1-morphisms. We also investigate which part of 2-representation theory of 2-categories extends to this new setup.
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
Interest in weak cubical n-categories arises in various contexts, in particular in topological field theories. In this paper, we describe a concept of double bicategory, namely a strict model of the theory of bicategories in Bicat. We show…
The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…
Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related…
Formalized $1$-category theory forms a core component of various libraries of mathematical proofs. However, more sophisticated results in fields from algebraic topology to theoretical physics, where objects have "higher structure," rely on…