Complexity of hybrid logics over transitive frames (Q631089)

From MaRDI portal
Revision as of 05:35, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of hybrid logics over transitive frames
scientific article

    Statements

    title
    Complexity of hybrid logics over transitive frames (English)
    0 references
    author
    Martin Mundhenk
    0 references
    Thomas Schneider
    0 references
    Thomas Schwentick
    0 references
    Volker Weber
    0 references
    publication date
    22 March 2011
    0 references
    zbMATH Keywords
    hybrid logic
    0 references
    satisfiability
    0 references
    decidability
    0 references
    complexity
    0 references
    cites work
    PDL for ordered trees
    0 references
    Q4945233
    0 references
    Hybrid languages
    0 references
    Q4215593
    0 references
    Q2744124
    0 references
    Q5691140
    0 references
    Q4386924
    0 references
    Q2753601
    0 references
    Computer Science Logic
    0 references
    Q4736875
    0 references
    Q4417866
    0 references
    Q4370234
    0 references
    Q5715707
    0 references
    Q4298260
    0 references
    Q5556395
    0 references
    Q4833777
    0 references
    Computer Science Logic
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03B45
    0 references
    03B25
    0 references
    03D15
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5869151
    0 references
    OpenAlex ID
    W2811227589
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q631089&oldid=38178907"
    Powered by MediaWiki