Quantification over sets of possible worlds in branching-time semantics
From MaRDI portal
Publication:2500778
DOI10.1007/s11225-006-8104-zzbMath1103.03019OpenAlexW2014996135MaRDI QIDQ2500778
Publication date: 18 August 2006
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-006-8104-z
Related Items
Системы временной логики I: моменты, истории, деревья, Analyzing completeness of axiomatic functional systems for temporal × modal logics, First-order definability of transition structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Moment/history duality in Prior's logics of branching-time
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- Decidability for branching time
- Local model checking in the modal mu-calculus
- Combinations of tense and modality for predicate logic
- Topological aspects of branching-time semantics
- Decidable fragments of first-order temporal logics
- Specification in CTL + past for verification in CTL.
- Propositional \(\text Q\)-logic
- Temporal logic. From ancient ideas to artificial intelligence
- Axiomatization of `Peircean' branching-time logic
- An axiomatization of PCTL*
- An axiomatization of full Computation Tree Logic
- The decision problem for branching time logic
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- “Sometimes” and “not never” revisited
- Logic and time
- The unreal future
- Temporal patterns and modal structure
- Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
- On Non-local Propositional and Weak Monodic Quantified CTL*
- Branching-time logic with quantification over branches: The point of view of modal logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Completeness in the theory of types
- Axioms for Branching Time
