An axiomatization of full Computation Tree Logic (Q2758043)

From MaRDI portal
Revision as of 09:21, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An axiomatization of full Computation Tree Logic
scientific article

    Statements

    title
    An axiomatization of full Computation Tree Logic (English)
    0 references
    DOI
    10.2307/2695091
    0 references
    publication date
    7 January 2003
    0 references
    Mathematics Subject Classification ID
    03B44
    0 references
    03B70
    0 references
    68Q60
    0 references
    zbMATH DE Number
    1679317
    0 references
    zbMATH Keywords
    temporal logic
    0 references
    full computation tree logic
    0 references
    axiomatization
    0 references
    validity
    0 references
    satisfiability
    0 references
    semantics
    0 references
    Kripke structures
    0 references
    completeness
    0 references
    author
    M. A. Reynolds
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2758043&oldid=27217679"
    Powered by MediaWiki