Completeness and decidability results for CTL in constructive type theory (Q287375): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Big Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-free sequent systems for temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Automata in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and Decidability Results for CTL in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Beginning of Model Checking: A Personal Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite sets that Satisfy the Principle of Omniscience in any Variety of Constructive Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Formalisation of Finite Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructive Proof of Dependent Choice, Compatible with Classical Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminating Tableaux for Hybrid Logic with Eventualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A goal-directed decision procedure for hybrid PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075239 / rank
 
Normal rank

Latest revision as of 02:12, 12 July 2024

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