Modal Logic

Erscheinungsjahr 1997
ISBN: 978-0-19-853779-3
Verlag: OUP Oxford

Buch, Englisch, 620 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 1150 g

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators - `like it is necessary' in philosophy, `it is believed' in cognitive science, `it is provable' in mathematics and `it is true after executing a program' in computer science. It is an advanced text which starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantical and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge in mathematics.

A specialist can use the book as a source of references. For the first time results and methods of many directions in propositional modal logic - from completeness and duality to algorithmic problems - are collected and systematically presented in one volume. Unlike other books, modal logic is treated here as a uniform theory rather than a collection of a few particular systems. It is the only book presenting the theory of superintuitionistic logics.

Autoren/Hrsg.

Chagrov, Alexander

Zakharyaschev, Michael

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Geisteswissenschaften Philosophie Philosophische Logik, Argumentationstheorie

Inhaltsverzeichnis

- Introduction

- 1.: Classical logic

- 2.: Intuitionistic logic

- 3.: Modal logics

- 4.: From logics to classes of logics

- 5.: Canonical models and filtration

- 6.: Incompleteness

- 7.: Algebraic semantics

- 8.: Relational semantics

- 9.: Canonical formulas

- 10.: Kripke completeness

- 11.: The finite approximability

- 12.: Tabularity

- 13.: Post completeness

- 14.: Interpolation

- 15.: The disjunction property and Halldén completeness

- 16.: The decidability of logics

- 17.: Admissibility and drivability of inference rules

- 18.: The decidability of logics' properties

- 19.: Complexity problems

- Reference

- Index