The complexity of linear-time temporal logic over the class of ordinals (Q3081444): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1009.5206 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:52, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of linear-time temporal logic over the class of ordinals |
scientific article |
Statements
The complexity of linear-time temporal logic over the class of ordinals (English)
0 references
8 March 2011
0 references
linear-time temporal logic
0 references
ordinal
0 references
polynomial space
0 references
satisfiability problem
0 references
ordinal automaton
0 references
