Theorem Proving with Analytic Tableaux and Related Methods: 4th International Workshop, TABLEAUX-95, Schloß Rheinfels, St. Goar, Germany, May 7 - 10, 1995. Proceedings / Edition 1

by Peter Baumgartner, Reiner Hähnle, Joachim Posegga

Overview

This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloß Rheinfels, St. Goar, Germany in May 1995.

Originally tableau calculi and their relatives were favored primarily as a pedagogical device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications

Product Details

ISBN-13:	9783540593386
Publisher:	Springer Berlin Heidelberg
Publication date:	06/08/1995
Series:	Lecture Notes in Computer Science , #918
Edition description:	1995
Pages:	361
Product dimensions:	6.10(w) x 9.17(h) x 0.36(d)

Table of Contents

Issues in theorem proving based on the connection method.- Rigid E-unification simplified.- Generating finite counter examples with semantic tableaux.- Semantic tableaus for inheritance nets.- Using connection method in modal logics: Some advantages.- Labelled tableaux for multi-modal logics.- Refutation systems for prepositional modal logics.- On transforming intuitionistic matrix proofs into standard-sequent proofs.- A connection based proof method for intuitionistic logic.- Tableau for intuitionistic predicate logic as metatheory.- Model building and interactive theory discovery.- Link deletion in model elimination.- Specifications of inference rules and their automatic translation.- Constraint model elimination and a PTTP-implementation.- Non-elementary speedups between different versions of tableaux.- Syntactic reduction of predicate tableaux to propositional tableaux.- Classical Lambek logic.- Linear logic with isabelle: Pruning the proof search tree.- Linear analytic tableaux.- Higher-order tableaux.- Propositional logics on the computer.- MacKE: Yet another proof assistant & automated pedagogic tool.- Using the theorem prover SETHEO for verifying the development of a communication prool in FOCUS -A Case Study-.