First Page | Document Content | |
---|---|---|
Date: 2011-06-16 09:07:59Theoretical computer science Logic Mathematical logic Automated theorem proving Logic programming Logical truth Propositional calculus Substitution Nqthm Rewrite order Symbol | Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨Add to Reading ListSource URL: www.dcs.bbk.ac.ukDownload Document from Source WebsiteFile Size: 335,48 KBShare Document on Facebook |