相关论文: The three dimensions of proofs

Proof assistants play a dual role as programming languages and logical systems. As programming languages, proof assistants offer standard modularity mechanisms such as first-class functions, type polymorphism and modules. As logical…

In this paper we analyze the propositional extensions of the minimal classical modal logic system E, which form a lattice denoted as CExtE. Our method of analysis uses algebraic calculations with canonical forms, which are a generalization…

We investigate the representation theory of the polynomial core of the quantum Teichmuller space of a punctured surface S. This is a purely algebraic object, closely related to the combinatorics of the simplicial complex of ideal cell…

The N-dimensional generalization of Bertrand spaces as families of Maximally superintegrable systems on spaces with nonconstant curvature is analyzed. Considering the classification of two dimensional radial systems admitting 3 constants of…

The Newman-Penrose formalism in transverse tetrads, namely those tetrads where \Psi_1=\Psi_3=0, is studied. In particular it is shown that the equations governing the dynamics within this formalism can be recast in a particularly compact…

We prove the 3-fold DT/PT correspondence for K-theoretic vertices via wall-crossing techniques. We provide two different setups, following Mochizuki and following Joyce; both reduce the problem to q-combinatorial identities on word…

Using the theory of plugs and the self-insertion construction due to the second author, we prove that a foliation of any codimension of any manifold can be modified in a real analytic or piecewise-linear fashion so that all minimal sets…

The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…

We determine the image of the monodromy map for meromorphic projective structures with poles of orders greater than two. This proves the analogue of a theorem of Gallo-Kapovich-Marden, and answers a question of Allegretti and Bridgeland.…

We study sets $V$ in the tridisc that are relatively polynomially convex and have the polynomial extension property. If $V$ is one-dimensional, and is either algebraic, or has polynomially convex projections, we show that it is a retract.…

We prove the multiplicative version of the dimensional reduction theorem in cohomological Donaldson--Thomas theory. More precisely, we show that the BPS cohomology associated with the loop stack of a $0$-shifted symplectic stack admits a…

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

Spaces of homogeneous spherical monogenics in dimension 3 can be considered naturally as sl(2,C)-modules. As finite-dimensional irreducible sl(2,C)-modules, they have canonical bases which are, by construction, orthogonal. In this note, we…

The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed in polynomial space whereas semantic approaches directly…

We prove that the propositional translations of the Kneser-Lov\'asz theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lov\'asz…

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very…

Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word…

This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking…

A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a…