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

From MaRDI portal
Revision as of 05:10, 15 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q465580)
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
    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