HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder (Q7034355)
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 7977733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder |
scientific article; zbMATH DE number 7977733 |
Statements
HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder (English)
0 references
31 January 2025
0 references
HyperLTL
0 references
HyperCTL*
0 references
satisfiability
0 references
analytical hierarchy
0 references
