The complexity of propositional linear temporal logics in simple cases (Q1854521)

From MaRDI portal
Revision as of 11:14, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of propositional linear temporal logics in simple cases
scientific article

    Statements

    title
    The complexity of propositional linear temporal logics in simple cases (English)
    0 references
    author
    Philippe Schnoebelen
    0 references
    Stéphane P. Demri
    0 references
    publication date
    14 January 2003
    0 references
    Mathematics Subject Classification ID
    68Q60
    0 references
    03B44
    0 references
    68Q17
    0 references
    zbMATH DE Number
    1853252
    0 references
    OpenAlex ID
    W2026379532
    0 references
    cites work
    Q2753678
    0 references
    Q4381382
    0 references
    Q4945225
    0 references
    Q4952323
    0 references
    Q4385542
    0 references
    Q2771058
    0 references
    Q4002642
    0 references
    Q4298260
    0 references
    Q4068699
    0 references
    Q4833777
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1854521&oldid=34330213"
    Powered by MediaWiki