Effective completeness theorems for modal logic (Q1877094): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3867808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4249355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof methods for modal and intuitionistic logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: First-order modal logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completeness of an intensional logic: Definite topological logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4249356 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4698331 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidable Kripke models of intuitionistic theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3125203 / rank | |||
Normal rank |
Latest revision as of 19:58, 6 June 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