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.
2015
2015
Restricted Distribution Automatizability in PAC-Semantics
We consider the proof search (--automatizability--) problem for propositional proof systems in the context of knowledge discovery… 
2012
2012
2005 Summer Meeting of the Association for Symbolic Logic Logic Colloquium '05 Abstracts of Invited Plenary Talks Abstract of Invited Talk in the Short Course on Computer Science Logic
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of… 
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… 
2010
2010
IAS / PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 13 : Polynomial-Size Frege Proofs of the Pigeonhole Principle
The pigeonhole principle states that there is no one-to-one function from a set of size n to a set of size n − 1. In other words… 
2005
2005
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata… 
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
1995
Review
1995
Are thereHardExamples for Frege Systems ?
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews… 
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)