Abstract
The essential structure of derivations is used as a tool for measuring the complexity of schema consequences in propositional-based logics. Our schema derivations allow the use of schema lemmas and this is reflected on the schema complexity. In particular, the number of times a schema lemma is used in a derivation is not relevant. We also address the application of metatheorems and compare the complexity of a schema derivation after eliminating the metatheorem and before doing so. As illustrations, we consider a propositional modal logic presented by a Hilbert calculus and an intuitionist propositional logic presented by a Gentzen calculus. For the former, we discuss the use of the metatheorem of deduction and its elimination, and for the latter, we analyze the cut and its elimination. Furthermore, we capitalize on the result for the cut elimination for intuitionistic logic, to obtain a similar result for Nelson’s logic via a language translation.
Funder
Instituto de Telecomunicações
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference25 articles.
1. Hilbert's Twenty-Fourth Problem
2. The Collected Papers of Gerhard Gentzen;Gentzen,1969
3. Natural Deduction. A Proof-Theoretical Study;Prawitz,1965
4. On the idea of a general proof theory
5. Improved bounds to the length of proofs of finitistic consistency statements;Pudlák;Contemp. Math. Log. Comb.,1987