An axiomatization of full computation tree logic
DOI10.2307/2695091zbMATH Open1002.03015OpenAlexW2153737593MaRDI QIDQ2758043FDOQ2758043
Authors: Mark Alexander Reynolds 
Publication date: 7 January 2003
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.2813
Recommendations
semanticscompletenesssatisfiabilityvalidityaxiomatizationtemporal logicKripke structuresfull computation tree logic
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70)
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 (42)
- 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
- 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
- Axiomatising tree-interpretable structures
- Title not available (Why is that?)
- Completeness and decidability results for CTL in constructive type theory
- 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
- Axiomatising extended computation tree logic
- Propositional \(\text Q\)-logic
- Decidability and expressivity of Ockhamist propositional dynamic logics
- A rooted tableau for \(\mathrm{BCTL}^*\)
- Probabilistic logics based on Riesz spaces
- 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
- Completeness and complexity of multi-modal CTL
- From the archives of the formal methods and tools lab. Axiomatising and contextualising ACTL
- Multi-modal CTL: completeness, complexity, and an application
- A compositional approach to CTL\(^*\) verification
- 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
- Branching time? Pruning time!
- 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?)
- A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
- 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)
