Modal logic
著者
書誌事項
Modal logic
(Oxford logic guides, 35)
Clarendon Press , Oxford University Press, 1997
大学図書館所蔵 全52件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. [567]-595) and index
内容説明・目次
内容説明
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.
目次
- 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 Hallden completeness
- 16. The decidability of logics
- 17. Admissibility and drivability of inference rules
- 18. The decidability of logics' properties
- 19. Complexity problems
- Reference
- Index
「Nielsen BookData」 より