Frege systems for quantified Boolean logic
<p>We define and investigate Frege systems for quantified Boolean formulas (QBF). For these new proof systems, we develop a lower bound technique that directly lifts circuit lower bounds for a circuit class C to the QBF Frege system operating with lines from C. Such a direct transfer from circ...
Main Authors: | Beyersdorff, O, Bonacina, I, Chew, L, Pich, J |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Association for Computing Machinery
2020
|
Similar Items
-
Learning algorithms versus automatability of Frege systems
by: Pich, J, et al.
Published: (2022) -
Frege's paradox.
by: Mendelsohn, Richard Lloyd, et al.
Published: (2009) -
Reasons for hardness in QBF proof systems
by: Beyersdorff, O, et al.
Published: (2020) -
Epistemological consequences of Frege puzzles
by: Williamson, T
Published: (2021) -
Frege's problem about concepts
by: Russinoff, Ilene Susan
Published: (2009)