What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
Hilbert's epsilon-Terms in Automated Theorem Proving
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
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
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A Sound Framework for δ-Rule Variants in Free-Variable Semantic Tableaux
Journal of Automated Reasoning
Shallow confluence of conditional term rewriting systems
Journal of Symbolic Computation
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
On the dynamic increase of multiplicities in matrix proof methods for classical higher-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A generic modular data structure for proof attempts alternating on ideas and granularity
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
| Hi-index | 0.00 |
Using a human-oriented formal example proof of the lim+-theorem (that the sum of limits is the limit of the sum), we exhibit a non-permutability of @b-steps and @d^+-steps (according to Smullyan's classification), which is not visible with non-liberalized @d-rules and dissolves into a problem of mere inefficiency with further liberalized @d-rules, such as the @d^+^+-rules. Beside a careful presentation of the human-oriented search for a formal proof of (lim+), our main intention is to show where sequent and tableau calculi are in conflict with human-oriented proof construction.