Undecidable properties of extensions of provability logic. II (Q805607): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Alexander Chagrov / rank | |||
Property / reviewed by | |||
Property / reviewed by: Vladimir Vladimirovich Rybakov / rank | |||
Property / author | |||
Property / author: Alexander Chagrov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Vladimir Vladimirovich Rybakov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undecidable properties of extensions of the logic of provability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Varieties of logical matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Post Completeness and Free Algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On systems of modal logic with provability interpretations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3784045 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 17:34, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Undecidable properties of extensions of provability logic. II |
scientific article |
Statements
Undecidable properties of extensions of provability logic. II (English)
0 references
1990
0 references
[For part I see Algebra Logika 29, No.3, 350-367 (1990; Zbl 0723.03005).] The aim of this paper is to study questions of effective recognition of properties of modal logics which extend the Gödel-Löb system GL. Using some uniform emulation method for the working of a Minski maschine in modal propositional logic, the author shows that the following properties: a) to be Kripke-complete, b) to be the modal counterpart of Int, c) to be closed with respect to the Gödel normalization rule, d) to be Halldén-complete, are undecidable. By the way, some interesting results of other kinds are obtained. For instance that there are \(2^{\omega}\) maximal logics among the modal counterparts of Int extending the logic S.
0 references
modal logics which extend the Gödel-Löb system GL
0 references
Minski maschine
0 references