Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity (Q5477458)

From MaRDI portal
Revision as of 01:52, 28 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5038544
Language Label Description Also known as
English
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
scientific article; zbMATH DE number 5038544

    Statements

    Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity (English)
    0 references
    0 references
    0 references
    3 July 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic logic
    0 references
    axiomatization
    0 references
    decidability
    0 references
    temporal logic
    0 references