Questions tagged [proof-complexity]
Proof complexity is the field aiming to understand and analyse the computational resources that are required to prove or refute statements.
25 questions
0
votes
0
answers
110
views
Terminology: commonly used name for an $\omega$ machine?
I am writing an expository essay on certain aspects of mathematical proofs, and one recurring pattern is the kind of question which is short in one direction but long in the other. A couple of ...
- 109
4
votes
1
answer
149
views
Complexity of the clause fragment of propositional Łukasiewicz logic
Disclaimer: this is a repost of a MS question with the same title — https://math.stackexchange.com/questions/5072398/complexity-of-the-clause-fragment-of-%c5%81ukasiewicz-logic
People who know the ...
1
vote
0
answers
215
views
For a given theory $T$, do all theorems provable in $T$ have "short" proofs using stronger theories?
Godel's speedup theorem states that for a given theory $T$ we can build specific theorems that have only very long proofs in $T$ but short ones in $T + con_T$.
What do we know about the case of all ...
- 119
1
vote
0
answers
125
views
Effortless automated proofs for "simple" formulae?
From small cases to all of them. This is in the spirit of 15 theorem see https://en.wikipedia.org/wiki/15_and_290_theorems
EXAMPLE : Suppose you have the following problem: P(a)
For any fixed non ...
- 1,386
1
vote
2
answers
145
views
Hardness of a Hybrid problem combining knapsack and scheduling
I am trying to prove whether the following problem is NP-hard or not:
Items with a certain length arrive in a fixed sequence and must be assigned to one of two containers which are constrained in ...
- 21
10
votes
2
answers
3k
views
MIP*=RE theorem and its impact on logic and proof theory
In the monumental paper MIP*=RE five authors, Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen, managed to show that two complexity classes: RE and MIP* do in fact coincide. ...
- 9,634
0
votes
0
answers
116
views
1-degree SOS proof refutes Linear Programming
I am trying to understand Sums-of-Squares proof systems.
A degree $d$ Sums-of-Squares refutation for a set of polynomial equations $P = \{p_1(x) = 0, ..., p_m(x) = 0\}$ is defined as
$\sum_{i=1}^m g_i(...
10
votes
4
answers
2k
views
Computational complexity theoretic incompleteness: is that a thing?
Has anyone done research in an area that I have not heard of but that I want to call "Computational complexity theoretic incompleteness", which would mean not absolute incompleteness in the ...
- 203
3
votes
1
answer
173
views
Does extended Frege p-simulate circuit Frege with substitutions?
Consider propositional logic.
Frege systems are textbook-style proof systems, with a finite set of logically sound axioms and rules. However you can generalise each axiom/rule with substitutions, ...
- 33
3
votes
1
answer
2k
views
When do you get to the point of writing proofs that need to be so complicated that verifying the details becomes a great burden on others?
Keyword here is need, many people thought I meant this intentionally rather than as an inevitability. I recently reread the article on Fukaya's work at Quanta and looked into the situation a bit more ...
- 755
3
votes
0
answers
95
views
Explicit tautologies requiring lots/few uses of modus ponens in minimal proofs
I am interested in minimal length proofs of tautologies in propositional logic. For concreteness, let's fix a particular Frege system $F$ (i.e., sound and complete set of axioms and deduction rules ...
- 1,115
6
votes
3
answers
694
views
Zero-knowledge proof for $P \ne NP$?
In computational complexity, $P \ne NP$ is a widely believed conjecture. Suppose that someone discovered a proof for it. He wants to publish a proof that he correctly proved the conjecture. I am aware ...
- 3,035
3
votes
0
answers
175
views
Lengths of proofs and quasilinear time
Length of proofs depends not only on the theory but also on its axiomatization. Once an axiomatization is fixed, typical proof systems are equivalent up to a polynomial factor. But what if we care ...
- 8,668
10
votes
1
answer
1k
views
Is there good reference for proof complexity?
I am asking if there are some good or standard references for proof complexity theory? I didn't find references when I search in internet. Thanks!
- 873
12
votes
2
answers
2k
views
Connections between Complexity Theory & Set Theory
Inspired by Joshua Grochow and Iddo Tzameret's answers in a post on http://cstheory.stackexchange.com , I would like to get more references on possible connections between complexity theory and set ...
10
votes
2
answers
769
views
Bounded Arithmetic vs Complexity Theory
In this post, when I talk about bounded arithmetic theories,
I mean the theories of arithmetic according to "Logical Foundations of Proof Complexity", which capture the complexity classes between $AC^...
- 103
7
votes
1
answer
292
views
Oracle queries asked in parallel
Definition: Assume that $\phi(q)$ is of the form $\exists y \leq 2^{p(n)} \varphi(q,y)$, where $p$ is a polynomial and $n = |q|$ (i.e. $n$ is the length of the binary representation of $q$). Then a ...
5
votes
0
answers
291
views
Is there a program for theory of incompleteness in NP?
Motivated by Suresh's post, Techniques for showing that problem is in hardness limbo, it seems that there might be an underlying theory that explains why some of these problems can not be complete for ...
- 3,035
4
votes
1
answer
166
views
Results where complexity bounds implies finite number of test cases
We have all been there, when a formula works for the first 30 parameters,
but it is not sufficient for a proof. My question is where one can actually just check a finite number of cases, to conclude ...
- 16.1k
16
votes
3
answers
1k
views
Finite versions of Godel' s incompleteness
Assume you have some notion of proof complexity: for instance, at the basic level, the length of a proof, or the number of symbols used, take your pick (there are more involved measures, but for sake ...
- 8,048
3
votes
2
answers
645
views
Measure of progress towards a proof
Can one define some measure of progress towards a proof of a statement? I'm not sure if it's even possible for general first order logic statements so let's restrict ourselves to propositional ...
- 31
4
votes
1
answer
804
views
Proof system with same complexity as "informal mathematics"?
The Completeness Theorem in first-order logic states that any mathematical validity is derivable from axioms. Hence, any informal mathematical proof (which is rigorous) can be translated into a formal ...
- 3,587
4
votes
1
answer
714
views
Proof systems and their hierarchy
Why ZFC is placed in top of the proof system hierarchy? How it can p-simulate other systems?
- 41
3
votes
0
answers
287
views
Oracle separating FIP for bounded-depth Frege from FIP for Frege (and hardness conditions on DDH)
Is there an oracle such that in the relativized world, bd-Frege (bounded depth Frege propositional proof system) has FIP (feasible interpolation property) but Frege does not have FIP?
Such an oracle ...
- 5,712
72
votes
31
answers
9k
views
Can infinity shorten proofs a lot?
I've just been asked for a good example of a situation in maths where using infinity can greatly shorten an argument. The person who wants the example wants it as part of a presentation to the general ...
- 29.5k