Quantification in Nonclassical Logic

Informationen zum Autor Dov M. Gabbay is Augustus De Morgan Professor Emeritus of Logic at the Group of Logic, Language and Computation, Department of Computer Science, King's College London. He has authored over four hundred and fifty research papers and over thirty research monographs. He is editor of several international Journals, and many reference works and Handbooks of Logic. Zusammenfassung Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy and language in ancient times. This title emphasises on model-theoretic and it concentrates on descriptions of different sound semantics and completeness problem.

Autorentext
Dov M. Gabbay is Augustus De Morgan Professor Emeritus of Logic at the Group of Logic, Language and Computation, Department of Computer Science, King's College London. He has authored over four hundred and fifty research papers and over thirty research monographs. He is editor of several international Journals, and many reference works and Handbooks of Logic.

Klappentext
This book contains basic results in propositional logics, and necessary syntactic background for first-order logic. Also, it describes different semantics for logics and proves soundness results. In addition, it considers the simplest kinds of relational semantics - the standard Kripke semantics and Kripke sheaves. In doing so, it introduces algebraic and topological semantics and studies Kripke metaframe semantics and related semantics.

Zusammenfassung
Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy and language in ancient times. This title emphasises on model-theoretic and it concentrates on descriptions of different sound semantics and completeness problem.

Inhalt
1.) Basic Propositional Logic 2.) Basic Predicate Logic3.) Kripke Semantics4.) Algebraic Semantics5.) Metaframe Semantics6.) Kripke completeness for varying domains7.) Kripke completeness for constant domains