Related papers: Borel Functors and Infinitary Interpretations

In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…

We extend Lang's conjectures to the setting of intermediate hyperbolicity and prove two new results motivated by these conjectures. More precisely, we first extend the notion of algebraic hyperbolicity (originally introduced by Demailly) to…

This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Lawvere observed in his celebrated work on hyperdoctrines that the set-theoretic schema of comprehension can be elegantly expressed in the functorial language of categorical logic, as a comprehension structure on the functor…

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

We start by giving a survey to the theory of Borel*(\kappa) sets in the generalized Baire space Baire({\kappa}) = {\kappa}^{\kappa}. In particular we look at the relation of this complexity class to other complexity classes which we denote…

We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…

We extend the study of \emph{melonic} quartic tensor models to models with arbitrary quartic interactions. This extension requires a new version of the loop vertex expansion using several species of intermediate fields and iterated…

In arXiv:2011.03313, the author has constructed a category of abstractly automorphic representations for $\mathrm{GL}(2)$ over a function field $F$. This is a symmetric monoidal Abelian category, constructed with the goal of having the…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

We study a number of categorical quasi-uniform structures induced by functors. We depart from a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, then define the continuity of a $\mathcal{C}$-morphism…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

We discuss the group of automorphisms of a general MR-algebra. We develop several functors between implication algebras and cubic algebras. These allow us to generalize the notion of inner automorphism. We then show that this group is…

We describe dual notions of tangent bundle for an infinity-topos, each underlying a tangent infinity-category in the sense of Bauer, Burke and the author. One of those notions is Lurie's tangent bundle functor for presentable…

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$…

This paper argues that interpretability research in Artificial Intelligence (AI) is fundamentally ill-posed as existing definitions of interpretability fail to describe how interpretability can be formally tested or designed for. We posit…

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

As machine learning algorithms getting adopted in an ever-increasing number of applications, interpretation has emerged as a crucial desideratum. In this paper, we propose a mathematical definition for the human-interpretable model. In…