Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,263,047 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Frege's propositional calculus
Functional completeness
Hajós construction
Hilbert system
Expand
Broader (2)
Logic in computer science
Propositional calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Generating Matrix Identities and Proof Complexity Fu Li
Iddo Tzameret
2014
Corpus ID: 22381599
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard…
Expand
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
C. Parsons
,
P. Bernays
2012
Corpus ID: 13902187
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of…
Expand
Review
2012
Review
2012
Jan Krajíček. Forcing with random variables and proof complexity . London Mathematical Society Lecture Note Series, vol. 232. Cambridge University Press, 2011, xvi + 247 pp.
S. Buss
2012
Corpus ID: 973512
Bounded arithmetic has many intimate connections with feasible computational complexity and questions related to the P versus NP…
Expand
2011
2011
Propositional logic, complexity theory and a nontrivial hierarchy of theories of weak fragments of peano arithmetic
Christoph Schöller
2011
Corpus ID: 73560101
In dieser Arbeit betrachte ich einige Arbeiten von Paris, Wilky [key-1] und Ajati [key-3, key-4] welche einen Zusammenhang…
Expand
2010
2010
COMPARISON OF PROOF SIZES IN FREGE SYSTEMS AND SUBSTITUTION FREGE SYSTEMS
A. Chubaryan
,
H. Nalbandyan
2010
Corpus ID: 67806545
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…
Expand
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
D. Barrington
,
Alexis Maciel
2010
Corpus ID: 3220706
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…
Expand
2007
2007
Finite Fields and Propositional Proof Systems
Michael Soltys
2007
Corpus ID: 15070309
Propositional proof complexity is a well established area of theoretical computer science; it is an area of research intimately…
Expand
2005
2005
Upper bounds on complexity of Frege proofs with limited use of certain schemata
Pavel Naumov
Archive for Mathematical Logic
2005
Corpus ID: 13524858
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata…
Expand
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…
Expand
Review
1995
Review
1995
Are thereHardExamples for Frege Systems ?
Maria Luisa Bonet
1995
Corpus ID: 16349534
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews…
Expand