Pages that link to "Item:Q5059700"
From MaRDI portal
The following pages link to Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700):
Displayed 3 items.
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Computational complexity of theories of a binary predicate with a small number of variables (Q2696689) (← links)
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? (Q6075540) (← links)