2 search results - page 1 / 1 » Examining fragments of the quantified propositional calculus |
JSYML
2008
13 years 4 months ago
2008
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
IJCAI
2001
13 years 6 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...