Propositional dynamic logic of looping and converse is elementarily decidable (Q3662639)
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: Propositional dynamic logic of looping and converse is elementarily decidable |
scientific article; zbMATH DE number 3814994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propositional dynamic logic of looping and converse is elementarily decidable |
scientific article; zbMATH DE number 3814994 |
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
