相关论文: The three dimensions of proofs

In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system $\mathbf{P}$ at least as strong as Full Lambek calculus, $\mathbf{FL}$, and polynomially simulated by the extended Frege…

To represent positive integers by regular patterns on a plane or in three-dimensional space may be traced back to the Pythagoreans. The aim of the present article is to explore the possibility of extending the representation framework for…

The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…

We evaluate the three-loop massive vacuum bubble diagrams in terms of polylogarithms up to weight six. We also construct the basis of irrational constants being harmonic polylgarithms of arguments $e^{k i \pi/3}$.

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Recently many new classes of integrable systems in n dimensions occurring in classical and quantum mechanics have been shown to admit a functionally independent set of 2n-1 symmetries polynomial in the canonical momenta, so that they are in…

This is a survey of the geometry of complex cubic fourfolds with a view toward rationality questions. Topics include classical constructions of rational examples, Hodge structures and special cubic fourfolds, associated K3 surfaces and…

It is known that some theories of class $S$ are actually factorized into multiple decoupled nontrivial four-dimensional $N=2$ theories. We propose a way of constructing examples of this phenomenon using the physics of half-BPS surface…

This paper is devoted to the stability analysis of spatially interconnected systems (SISs) via the sum-of-squares (SOS) decomposition of positive trigonometric polynomials. For each spatial direction of SISs, three types of interconnected…

We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two…

There has been much discussion in the literature about rival measures of classical polarization in three dimensions. We gather and compare the various proposed measures of polarization, creating a geometric representation of the…

We use a mechanized verification system, PVS, to examine the argument from Anselm's Proslogion Chapter III, the so-called "Modal Ontological Argument." We consider several published formalizations for the argument and show they are all…

Machine-assisted theorem proving refers to the process of conducting structured reasoning to automatically generate proofs for mathematical theorems. Recently, there has been a surge of interest in using machine learning models in…

The Sum-of-Squares (SoS) hierarchy, also known as Lasserre hierarchy, has emerged as a promising tool in optimization. However, it remains unclear whether fixed-degree SoS proofs can be automated [O'Donnell (2017)]. Indeed, there are…

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…

Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of…

This is the first paper in a series on new higher categorical structures called higher Segal spaces. For every d > 0, we introduce the notion of a d-Segal space which is a simplicial space satisfying locality conditions related to…

Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for…

Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Spatial Logic of Closure Spaces, SLCS, extends Modal Logic with reachability…

We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using…