Quantification over sets of possible worlds in branching-time semantics (Q2500778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Non-local Propositional and Weak Monodic Quantified CTL* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal patterns and modal structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unreal future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability for branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867808 / 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: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in the theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable fragments of first-order temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification in CTL + past for verification in CTL. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic. From ancient ideas to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of PCTL* / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of full Computation Tree Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for Branching Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological aspects of branching-time semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local model checking in the modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinations of tense and modality for predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional \(\text Q\)-logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite axiomatization of the set of strongly valid Ockhamist formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatization of `Peircean' branching-time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-time logic with quantification over branches: The point of view of modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moment/history duality in Prior's logics of branching-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL / rank
 
Normal rank

Latest revision as of 19:25, 24 June 2024

scientific article
Language Label Description Also known as
English
Quantification over sets of possible worlds in branching-time semantics
scientific article

    Statements

    Quantification over sets of possible worlds in branching-time semantics (English)
    0 references
    0 references
    18 August 2006
    0 references
    0 references
    temporal logics
    0 references
    branching time
    0 references
    possible-worlds semantics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references