Pages that link to "Item:Q2758043"
From MaRDI portal
The following pages link to An axiomatization of full Computation Tree Logic (Q2758043):
Displaying 26 items.
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Information dynamics and uniform substitution (Q484920) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- Deontic action logic, atomic Boolean algebras and fault-tolerance (Q846527) (← links)
- Algebraic neighbourhood logic (Q929966) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- An approach to infinitary temporal proof theory (Q1762733) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Propositional \(\text Q\)-logic (Q1863958) (← links)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence (Q1928821) (← links)
- Intention as commitment toward time (Q1989411) (← links)
- A propositional dynamic logic for instantial neighborhood semantics (Q2323639) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- A Rooted Tableau for BCTL* (Q2825414) (← links)
- Decidability and Expressivity of Ockhamist Propositional Dynamic Logics (Q2835868) (← links)
- Branching Time? Pruning Time! (Q2908510) (← links)
- A Labeled Natural Deduction System for a Fragment of CTL * (Q3605539) (← links)
- Verifying Time and Communication Costs of Rule-Based Reasoners (Q3614874) (← links)
