The complexity of linear-time temporal logic over the class of ordinals (Q3081444)

From MaRDI portal
Revision as of 08:05, 30 August 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
The complexity of linear-time temporal logic over the class of ordinals
scientific article

    Statements

    The complexity of linear-time temporal logic over the class of ordinals (English)
    0 references
    0 references
    0 references
    8 March 2011
    0 references
    linear-time temporal logic
    0 references
    ordinal
    0 references
    polynomial space
    0 references
    satisfiability problem
    0 references
    ordinal automaton
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references