First-order logic and automated theorem proving
First-order logic and automated theorem proving
Non-elementary Speedups between Different Versions of Tableaux
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Hilbert's epsilon-Terms in Automated Theorem Proving
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
lim+, δ+, and Non-Permutability of β-Steps
Journal of Symbolic Computation
Hi-index | 0.00 |
In this paper, we present a further liberalization of the δ-rule in free variable semantic tableaux. It is effective in that (1) it is both a natural and intuitive liberalization, and (2) can reduce the proof size non elementarily as compared to previous versions of the δ-rule.