Skip to search formSkip to main contentSkip to account menu

Frege system

In proof complexity, a Frege system is a propositional proof system whose proofs are sequences of formulas derived using a finite set of sound and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Frege's propositional calculusFunctional completenessHajós constructionHilbert system

Broader (2)

Logic in computer sciencePropositional calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Forcing with Random Variables and Proof Complexity
  • J. Krajícek
  • London Mathematical Society lecture note series
  • 2006
  • Corpus ID: 40488376
A fundamental problem about the strength of non-deterministic computations is the problem whether the complexity class ${\cal N… 
Highly Cited
2004
Highly Cited
2004
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
Abstract This article is a continuation of our search for tautologies that are hard even for strong propositional proof systems… 
Highly Cited
2004
Highly Cited
2004
Mathematical Logic
We show that short bounded-depth Frege proofs of matrix identities, such as PQ = I ⊃ QP = I (over the field of two elements… 
2003
2003
Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games
We present a simple proof of the bounded-depth Frege lower bounds of Pitassi et. al. and Kraj´ˇ cek et. al. for the pigeonhole… 
2002
2002
Hard examples for bounded depth frege
  • Eli Ben-Sasson
  • Proceedings 17th IEEE Annual Conference on…
  • 2002
  • Corpus ID: 5720641
We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graph-based contradiction, whenever the… 
Highly Cited
1999
Highly Cited
1999
Non-Automatizability of Bounded-Depth Frege Proofs
Abstract.In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs… 
Highly Cited
1997
Highly Cited
1997
Lower bounds for resolution and cutting plane proofs and monotone computations
Abstract We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound… 
Highly Cited
1996
Highly Cited
1996
An Exponential Separation Between the Parity Principle and the Pigeonhole Principle
1990
1990
ALOGTIME and a conjecture of S.A. Cook
  • P. Clote
  • [] Proceedings. Fifth Annual IEEE Symposium on…
  • 1990
  • Corpus ID: 1389066
Usingsequential, machine-independent characterization of theparallel complexity classesACk andNCk, we establish the following… 
Highly Cited
1975
Highly Cited
1975
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
The motivation for this work comes from two general sources. The first source is the basic open question in complexity theory of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)