Related papers: Proof compression and NP versus PSPACE. Part 2

Motivated by the inapproximability of reconfiguration problems, we present a new PCP-type characterization of PSPACE, which we call a probabilistically checkable reconfiguration proof (PCRP): Any PSPACE computation can be encoded into an…

We survey recent developments on the Restriction conjecture.

In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into…

This extended abstract presents a logic, called Lp, that is capable of representing and reasoning with a wide variety of both qualitative and quantitative statistical information. The advantage of this logical formalism is that it offers a…

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

We found a counterexample to the conjecture of Karvatskyi and Pratsiovytyi concerning the topological type of the achievement set of an intermediate series (Proceedings of the International Geometry Center, 2023.…

In this paper we prove the probabilistic continuous complexity conjecture. In continuous complexity theory, this states that the complexity of solving a continuous problem with probability approaching 1 converges (in this limit) to the…

This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

In this preprint we prove that any finite slope modular form fits into a p-adic family of modular forms which is indexed by the weight. Here, the term p-adic family means that p-adic congruences between weights entail certain p-adic…

This paper is a survey of two kinds of "compressed" proof schemes, the \emph{matrix method} and \emph{proof nets}, as applied to a variety of logics ranging along the substructural hierarchy from classical all the way down to the…

Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…

A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…

Let $p$ be a prime number. We prove that the $P=W$ conjecture for $\mathrm{SL}_p$ is equivalent to the $P=W$ conjecture for $\mathrm{GL}_p$. As a consequence, we verify the $P=W$ conjecture for genus 2 and $\mathrm{SL}_p$. For the proof, we…

We prove the `weight elimination' part of the weight part of Serre's conjecture for mod 2 Galois representations for rank two unitary groups, by modifying the results in arXiv:1203.2552 and arXiv:1309.0527.

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…

We prove Haynes' version of the Duffin--Schaeffer conjecture for the $p$-adic numbers. In addition, we prove several results about an associated related but false conjecture, related to $p$-adic approximation in the spirit of Jarn\'ik and…