You are not currently logged in.
Access JSTOR through your library or other institution:
Quantified Propositional Logic and the Number of Lines of Tree-like Proofs
Studia Logica: An International Journal for Symbolic Logic
Vol. 64, No. 3 (Apr., 2000), pp. 315-321
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016155
Page Count: 7
You can always find the topics here!Topics: Tautologies, Polynomials, Sequents, Propositional logic, Sequent calculus, Simulations, Speed, Logical theorems, String, Property lines
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
There is an exponential speed-up in the number of lines of the quantified propositional sequent calculus over Substitution Frege Systems, if one considers proofs as trees. Whether this is true also for the number of symbols, is still an open problem.
Studia Logica: An International Journal for Symbolic Logic © 2000 Springer