Related papers: Mass problems and intuitionistic higher-order logi…
The Lambek calculus is a substructural logic known to be closely related to the formal language theory: on the one hand, it is used for generating formal languages by means of categorial grammars and, on the other hand, it has formal…
Constrained Horn Clauses (CHCs) are an intermediate program representation that can be generated by several verification tools, and that can be processed and solved by a number of Horn solvers. One of the main challenges when using CHCs in…
We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…
We begin the study of categorical logic for continuous model theory. In particular, we 1. introduce the notions of metric logical categories and functors as categorical equivalents of a metric theory and interpretations, 2. prove a…
With a model of a geometric theory in an arbitrary topos, we associate a site obtained by endowing a category of generalized elements of the model with a Grothendieck topology, which we call the antecedent topology. Then we show that the…
We study equivariant resolutions and local cohomologies of toric sheaves for affine toric varieties, where our focus is on the construction of new examples of decomposable maximal Cohen-Macaulay modules of higher rank. A result of Klyachko…
In this work, we introduce {\em topological representations of a quiver} as a system consisting of topological spaces and its relationships determined by the quiver. Such a setting gives a natural connection between topological…
We introduce the notion of a \emph{conic sequence} of a convex polytope. It is a way of building up a polytope starting from a vertex and attaching faces one by one with certain regulations. We apply this to a toric variety to obtain an…
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…
We report first steps towards elucidating the relationship between contextuality, measurement-based quantum computation (MBQC) and the non-classical logic of a topos associated with the computation. We show that, in a class of MBQC,…
Chain of Thought (CoT) of multi-step benefits from the logical structure of the reasoning steps and task-specific actions, significantly enhancing the mathematical reasoning capabilities of large language models. As the prevalence of long…
We introduce a number of tools for finding and studying \emph{hierarchically hyperbolic spaces (HHS)}, a rich class of spaces including mapping class groups of surfaces, Teichm\"{u}ller space with either the Teichm\"{u}ller or…
We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…
Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although…
After a somewhat rocky start, geometry and topology have established a foothold in machine learning. Message passing, either on graphs or higher-order complexes, is one of the main drivers of geometric deep learning, and paradigms that were…
We introduce Graph of Thoughts (GoT): a framework that advances prompting capabilities in large language models (LLMs) beyond those offered by paradigms such as Chain-of-Thought or Tree of Thoughts (ToT). The key idea and primary advantage…
Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…