On the computational complexity of satisfiability in propositional logics of programs (Q1170028)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of satisfiability in propositional logics of programs |
scientific article; zbMATH DE number 3782372
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of satisfiability in propositional logics of programs |
scientific article; zbMATH DE number 3782372 |
Statements
On the computational complexity of satisfiability in propositional logics of programs (English)
0 references
1982
0 references
complexity classes
0 references
nondeterminism
0 references
alternating Turing machine
0 references
satisfiability problem
0 references
propositional algorithmic logic
0 references
propositional dynamic logic
0 references
