Studia Logica, Volume 69

Volume 69, Number 1, October 2001

Roy Dyckhoff, Heinrich Wansing: Editorial. 3-4
Franz Baader, Ulrike Sattler: An Overview of Tableau Algorithms for Description Logics. 5-40
Linh Anh Nguyen: Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5. 41-57
Bernhard Beckert, Rajeev Goré: Free-Variable Tableaux for Propositional Modal Logics. 59-96
Marta Cialdea Mayer, Serenella Cerrito: Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics. 97-131
Melvin Fitting, Lars Thalmann, Andrei Voronkov: Term-Modal Logics. 133-169
Riccardo Rosati: A Sound and Complete Tableau Calculus for Reasoning about only Knowing and Knowing at Most. 171-191

Roy Dyckhoff, Heinrich Wansing: Editorial. 195-196
Arnon Avron, Beata Konikowska: Decomposition Proof Systems for Gödel-Dummett Logics. 197-219
Diderik Batens, Joke Meheus: Shortcuts and Dynamic Marking in the Tableau Method for Adaptive Logics. 221-248
Uwe Egly: On Different Intuitionistic Calculi and Embeddings from Int to S4. 249-277
Raymond D. Gumb: An Extended Joint Consistency Theorem for a Nonconstructive Logic of Partial Terms with Definite Descriptions. 279-292
Christoph Kreitz, Brigitte Pientka: Connection-Driven Inductive Theorem Proving. 293-326

Teresa Almada, Júlia Vaz de Carvalho: A Generalization of the Lukasiewicz Algebras. 329-338
Stephen H. Hechler: On Consistent Subsets of Large Sets of Satisfiable Sentences. 339-349
Max A. Freund: A Temporal Logic for Sortals. 351-380
Ivo Düntsch, Gunther Schmidt, Michael Winter: A Necessary Relation Algebra for Mereotopology. 381-409
Fabrice Correia: Priorean Strict Implication, Q and Related Systems. 411-427