相关论文: The three dimensions of proofs

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

The ever-growing complexity of mathematical proofs makes their manual verification by mathematicians very cognitively demanding. Autoformalization seeks to address this by translating proofs written in natural language into a formal…

We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space efficiency of a formalism F in representing a certain piece of knowledge A, is the size of the shortest formula of F…

We give explicit, uniform formulas for the graded characters and total ranks of the Lie algebra homology of finite-dimensional representations in all classical types. In many cases, these compute the Tor groups of finite length modules over…

We lay out an infinity categorical interpretation of reconstruction theorems which are germane to the symmetric monoidal perspective of noncommutative algebraic geometry, present sufficient conditions which allow for the factorization of…

We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity…

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and…

We study birational transformations P^n--->S \subseteq P^N defined by linear systems of quadrics whose base locus is smooth and irreducible of dimension \leq3 and whose image S is sufficiently regular.

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

Let S be a site. First we define the 3-category of torsors under a Picard S-2-stack and we compute its homotopy groups. Using calculus of fractions we define also a pure algebraic analogue of the 3-category of torsors under a Picard…

This paper describes a formal proof library, developed using the Coq proof assistant, designed to assist users in writing correct diagrammatic proofs, for 1-categories. This library proposes a deep-embedded, domain-specific formal language,…

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic…

We propose a general strategy to build three-dimensional gauge theories with four supercharges which enjoy a supersymmetry enhancement in the IR. The resulting IR SCFTs admit topological twists with particularly nice properties, as well as…

We show that the formalism of "Sum-Over-Path" (SOP), used for symbolically representing linear maps or quantum operators, together with a proper rewrite system, has a structure of dagger-compact PROP. Several consequences arise from this…

We give a new, direct proof of the tetrachotomy classification for the model-checking problem of positive equality-free logic parameterised by the model. The four complexity classes are Logspace, NP-complete, co-NP-complete and…

We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…

The extent to which neural networks are able to acquire and represent symbolic rules remains a key topic of research and debate. Much current work focuses on the impressive capabilities of large language models, as well as their often…

We define the category $\mathcal{QM}$ of quantales and their modules and prove the existence of coproducts, and the one of pushout and amalgamated coproducts under certain conditions. Then we define the non-full subcategory…