Propositional dynamic logic of looping and converse is elementarily decidable (Q3662639)

From MaRDI portal
Revision as of 16:43, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1982
    0 references
    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