Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy and
language in ancient times; they were studied by traditional informal
methods until the 20th century. In the last century the tools became
highly mathematical, and both modal logic and quantification found numerous applications in Computer Science. At the same time many other kinds of nonclassical logics were investigated and applied to Computer Science.
Although there exist several good books in propositional modal logics, this book is the first detailed monograph in nonclassical first-order quantification. It includes results obtained during the past thirty years. The field is very large, so we confine ourselves with only two kinds of logics: modal and superintuitionistic. The main emphasis of Volume 1 is model-theoretic, and it concentrates on descriptions of different sound semantics and completeness problem --- even for these seemingly simple questions we have our hands full. The major part of the presented material has never been published before. Some results are very recent, and for other results we either give new proofs or first proofs in full detail
Author(s): D.M. Gabbay, V.B. Shehtman and D.P. Skvortsov (Eds.)
Series: Studies in Logic and the Foundations of Mathematics 153
Publisher: Elsevier Science
Year: 2009
Content:
Edited by
Pages ii-iii
Copyright
Page iv
Preface
Pages v-vii
Introduction
Pages ix-xx
Chpater 1 Basic propositional logic
Pages 3-77
Chpater 2 Basic predicate logic
Pages 79-189
Introduction: What is semantics?
Pages 193-198
Chapter 3 Kripke semantics
Pages 199-291
Chpater 4 Algebraic semantics
Pages 293-343
Chpater 5 Metaframe semantics
Pages 345-480
Chpater 6 Kripke completeness for varying domains
Pages 483-551
Chpater 7 Kripke completeness for constant domains
Pages 553-592
Bibliography
Pages 593-602
Index
Pages 603-615