Related papers: Concrete categories and higher-order recursion (Wi…
Commutativity of program code (i.e. the equivalence of two code fragments composed in alternate orders) is of ongoing interest in many settings such as program verification, scalable concurrency, and security analysis. While some have…
The derived category of bounded complexes of coherent sheaves is one of the most important algebraic invariants of a smooth projective variety. An important approach to understand derived categories is to construct full strongly exceptional…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify…
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's…
Complex reasoning over text requires understanding and chaining together free-form predicates and logical connectives. Prior work has largely tried to do this either symbolically or with black-box transformers. We present a middle ground…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…
Let $\mathbb{k}$ be a field of characteristic $p$. We introduce a formalism of mixed sheaves with coefficients in $\mathbb{k}$ and showcase its use in representation theory. More precisely, we construct for all quasi-projective schemes $X$…
We demonstrate that large language models can produce reasonable numerical ratings of the logical consistency of claims. We also outline a mathematical approach based on sheaf theory for lifting such ratings to hypertexts such as laws,…
We formulate a version of Beck's monadicity theorem for abelian categories, which is applied to the equivariantization of abelian categories with respect to a finite group action. We prove that the equivariantization is compatible with the…
We study the homotopy right Kan extension of homotopy sheaves on a category to its free cocompletion, i.e. to its category of presheaves. Any pretopology on the original category induces a canonical pretopology of generalised coverings on…
We instal homological algebra, including derived functors, on certain non-additive categories like categories of pointed CW-complexes, modules of monoids or sheaves thereof. We apply this theory to Monoid schemes and sheaves on them,…
The use of aggregates in recursion enables efficient and scalable support for a wide range of BigData algorithms, including those used in graph applications, KDD applications, and ML applications, which have proven difficult to be expressed…
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Representations of vertex operator algebras define sheaves of coinvariants and conformal blocks on moduli of stable pointed curves. Assuming certain finiteness and semisimplicity conditions, we prove that such sheaves satisfy the…
In this paper we consider the problem of building rich categories of setoids, in standard intensional Martin-L\"of type theory (MLTT), and in particular how to handle the problem of equality on objects in this context. Any…