Completeness and decidability results for CTL in constructive type theory (Q287375)

From MaRDI portal
Revision as of 22:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Completeness and decidability results for CTL in constructive type theory
scientific article

    Statements

    Completeness and decidability results for CTL in constructive type theory (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computation tree logic (CTL)
    0 references
    Hilbert axiomatizations
    0 references
    completeness
    0 references
    decidability
    0 references
    Coq
    0 references
    Ssreflect
    0 references
    constructive proofs
    0 references
    interactive theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references