Axioms for branching time

Journal of Logic and Computation

Volumn 12, Issue 4, 2002, Pages 679-697

  Reynolds, Mark ^a  

^a MURDOCH UNIVERSITY   (Australia)

Author keywords

Axiomatizations; Decidability; Temporal logic

Indexed keywords

FORMAL LANGUAGES; MANY VALUED LOGICS; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

AXIOMIZATION; BRANCHING TIME LOGIC; COMPUTATION TREE LOGIC; HISTORICAL NECESSITY LOGIC; TEMPORAL LOGIC;

COMPUTABILITY AND DECIDABILITY;

EID: 0036677805     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.4.679     Document Type: Article

References (34)

1. Agents in branching time
2. The logic of 'nexttime'
3. Logic and time
4. Decidability for branching time
5. Characterizing correctness properties of parallel programs using fixpoints
6. Using branching time temporal logic to synthesise synchronisation skeletons
7. Decision procedures and expressiveness in the temporal logic of branching time
8. 'Sometimes' and 'not never' revisited: On branching versus linear time
9. Complexity of tree automata and modal logics of programs
10. Deciding branching time logic
11. The decision problem for branching time logic
12. To the decision problem for branching time logic
13. The complexity of reasoning about knowledge and time. I. Lower bounds
14. Monodic fragments of first-order temporal logics: 2000-2001
15. Tense logic and the theory of linear order
16. Results on the propositional μ-calculus
17. A hierarchy of temporal logics with past
18. Is the semantics of branching structures adequate for chronological modal logics
19. More past glories
20. An axiomatization of full computation tree logic
21. Modal and temporal logics
22. Indeterminist time and truth value gaps
23. Combinations of tense and modality
24. Axiomatizing the monodic fragment of first-order temporal logic
25. Decidability of deliberative stit theories with multiple agents
26. Ockhamist computational logic: Past-sensitive necessitation in CTL
27. Non-definability of the class of complete bundled trees
28. A finite axiomatization of the set of strongly valid Ockamist formulas
29. Axiomatization of 'Peircean' branching-time logic
30. A complete deductive system for since-until branching time logic
31. Branching-time logic with quantification over branches: The point of view of modal logic