Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700)
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 7642566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability of QLTL and QCTL with two variables and one monadic predicate letter |
scientific article; zbMATH DE number 7642566 |
Statements
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (English)
0 references
16 January 2023
0 references
quantified temporal logic
0 references
first-order temporal logic
0 references
linear-time temporal logic
0 references
branching-time temporal logic
0 references
restricted languages
0 references
undecidability
0 references
recursive enumerability
0 references
arithmetic complexity
0 references
algorithmic classification problem
0 references
satisfiability problem
0 references
validity problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8091176152229309
0 references
0.8076356649398804
0 references
0.7822290658950806
0 references
0.7772023677825928
0 references
