B and D are enough to make the Halpern-Shoham logic undecidable (Q3587452)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5780558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | B and D are enough to make the Halpern-Shoham logic undecidable |
scientific article; zbMATH DE number 5780558 |
Statements
B and D Are Enough to Make the Halpern–Shoham Logic Undecidable (English)
0 references
7 September 2010
0 references
0.9102537035942078
0 references
0.8429643511772156
0 references
0.8410499095916748
0 references
0.8086860775947571
0 references
