The decidable normal modal logics are not recursively enumerable (Q1072542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The decidable normal modal logics are not recursively enumerable |
scientific article; zbMATH DE number 3941507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The decidable normal modal logics are not recursively enumerable |
scientific article; zbMATH DE number 3941507 |
Statements
The decidable normal modal logics are not recursively enumerable (English)
0 references
1985
0 references
The author uses a construction of Urquhart to show that there is no effective enumeration of algorithms which includes at least one for every decidable normal modal logic and no others. This also shows that the set of all recursive presentations which determine decidable modal logics is not recursively enumerable.
0 references
recursive presentations
0 references
decidable modal logics
0 references
0.87006974
0 references
0.86284125
0 references
0.8592906
0 references
0.8571584
0 references
0 references
0.85127234
0 references
