On the computational complexity of satisfiability in propositional logics of programs (Q1170028): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of satisfiability in propositional logics of programs |
scientific article |
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
