Propositional dynamic logic of looping and converse is elementarily decidable (Q3662639): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:02, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Propositional dynamic logic of looping and converse is elementarily decidable |
scientific article |
Statements
Propositional dynamic logic of looping and converse is elementarily decidable (English)
0 references
1982
0 references
satisfiability problem
0 references
propositional dynamic logic
0 references
elementarily decidable
0 references
infinite trees
0 references
deterministic two-way automata
0 references
