Effective completeness theorems for modal logic (Q1877094): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Anil Nerode / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q468085 / rank | |||
Revision as of 16:03, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Effective completeness theorems for modal logic |
scientific article |
Statements
Effective completeness theorems for modal logic (English)
0 references
16 August 2004
0 references
The authors study computable model theory of modal logics. In particular, they prove that every decidable theory of modal logic has a Kripke model which is both locally decidable and globally decidable. This effective completeness theorem is proved for a number of particular first-order modal logics. For this purpose the authors develop a technique for effectively constructing Kripke models, which is analogous to well-known Henkin's method.
0 references
modal logic
0 references
computable model theory
0 references
Kripke models
0 references
decidable theory
0 references