相关论文: The three dimensions of proofs

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

In this article we show how any formula A with a proof in minimal implicational logic that is super-polynomially sized has a polynomially-sized proof in classical implicational propositional logic . This fact provides an argument in favor…

We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…

The universal Kummer threefold is a 9-dimensional variety that represents the total space of the 6-dimensional family of Kummer threefolds in 7-dimensional projective space. We compute defining polynomials for three versions of this family,…

Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…

Representation theorems for formal systems often take the form of an inductive translation that satisfies certain invariants, which are proved inductively. Theory morphisms and logical relations are common patterns of such inductive…

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

We show that once-extended anomalous 3-dimensional topological quantum field theories valued in the 2-category of k-linear categories are in canonical bijection with modular tensor categories equipped with a square root of the global…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

In the paper, the family of conformal four-point ladder diagrams in arbitrary space-time dimensions is considered. We use the representation obtained via explicit calculation using the operator approach and conformal quantum mechanics to…

This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…

Let X be a scroll over a rational surface. We construct a linear system of surfaces in P^3 yielding a birational map from P^3 to X. We apply this construction to the scrolls of Bordiga and Palatini.

"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…

Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative…

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

The established equivalence between 2-crossed modules and Gray 3-groups [M. Sarikaya and E. Ulualan, 2024] serves as a benchmark for higher-dimensional algebraic models. However, to the best of our knowledge, the established definitions of…

This paper gives an expository account of our experiments concerning relations between modular forms for congruence subgroups of SL(3,Z) and three dimensional Galois representations. The main new result presented here is a calculation of…

We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalizing the one introduced by…

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…