An axiomatization of full computation tree logic

Cites Work

Title not available (Why is that?)
A finite axiomatization of the set of strongly valid Ockhamist formulas
Decidability for branching time
Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
Non-definability of the class of complete bundled trees
Branching-time logic with quantification over branches: The point of view of modal logic
Testing and generating infinite sequences by a finite automaton
Deciding full branching time logic
Handbook of philosophical logic. Volume II: Extensions of classical logic
\(R\)-generability, and definability in branching time logics

Cited In (36)

A propositional dynamic logic for instantial neighborhood semantics
Системы временной логики I: моменты, истории, деревья
Probabilistic temporal logic with countably additive semantics
Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Title not available (Why is that?)
A survey on temporal logics for specifying and verifying real-time systems
Sublogics of a branching time logic of robustness
Verifying Time and Communication Costs of Rule-Based Reasoners
Branching Time? Pruning Time!
Axiomatising tree-interpretable structures
Axiomatization of a branching time logic with indistinguishability relations
A tableau-based decision procedure for CTL\(^*\)
An approach to infinitary temporal proof theory
(Heterogeneous) structured specifications in logics without interpolation
Axiomatising extended computation tree logic
Decidability and Expressivity of Ockhamist Propositional Dynamic Logics
Propositional \(\text Q\)-logic
A rooted tableau for \(\mathrm{BCTL}^*\)
A propositional linear time logic with time flow isomorphic to \(\omega^2\)
Mathematical modal logic: A view of its evolution
A propositional probabilistic logic with discrete linear time for reasoning about evidence
Completeness of a branching-time logic with possible choices
A compositional approach to CTL\(^*\) verification
A Decision Procedure for CTL* Based on Tableaux and Automata
An axiomatization of PCTL*
Algebraic neighbourhood logic
Title not available (Why is that?)
A Labeled Natural Deduction System for a Fragment of CTL *
Intention as commitment toward time
Deductive verification of alternating systems
Information dynamics and uniform substitution
Rewrite rules for \(\mathrm{CTL}^\ast\)
Probabilistic Temporal Logics
Quantification over sets of possible worlds in branching-time semantics
Title not available (Why is that?)
Deontic action logic, atomic Boolean algebras and fault-tolerance

This page was built for publication: An axiomatization of full computation tree logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758043)