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.
2017
2017
Uniform, integral and efficient proofs for the determinant identities
We give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over GF(2… 
2013
2013
Theories for Subexponential-size Bounded-depth Frege Proofs
This paper is a contribution to our understanding of the relationship between uniform and nonuniform proof complexity. The latter… 
Review
2012
Review
2012
Expressing versus Proving: Relating Forms of Complexity in Logic
Complexity in logic comes in many forms. In finite model theory, it is the complexity of describing properties, whereas in proof… 
2011
2011
Propositional logic, complexity theory and a nontrivial hierarchy of theories of weak fragments of peano arithmetic
In dieser Arbeit betrachte ich einige Arbeiten von Paris, Wilky [key-1] und Ajati [key-3, key-4] welche einen Zusammenhang… 
2010
2010
COMPARISON OF PROOF SIZES IN FREGE SYSTEMS AND SUBSTITUTION FREGE SYSTEMS
It is known that the minimal number of the steps in a proof of a tautology in a Frege system can be exponentially larger than in… 
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… 
2002
2002
Hard examples for bounded depth Frege
  • Eli Ben-Sasson
  • Proceedings 17th IEEE Annual Conference on…
  • 2002
  • Corpus ID: 46286964
We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graph-based contradiction, whenever the… 
1997
1997
On ACC<supscrpt>0</supscrpt>[<italic>p<supscrpt>k</supscrpt></italic>] Frege proofs
We show that for every prime power pk , quasipolynomiaf size bounded-depth Frege proofs with mod pk counting comectives can be… 
1997
1997
The number of lines in Frege proofs with substitution
Abstract. We prove that for sufficiently large $n$, there are tautologies of size $O(n)$ that require proofs containing… 
Review
1990
Review
1990
A Feasibly Constructive Lower Bound for Resolution Proofs
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)