Propositional temporal logics: decidability and completeness
From MaRDI portal
Recommendations
Cited in
(63)- Non-deterministic semantics for dynamic topological logic
- Dual systems of tableaux and sequents for PLTL
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Finite-trace linear temporal logic: coinductive completeness
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- A decision procedure and complete axiomatization for projection temporal logic
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- Efficient decision procedure for propositional projection temporal logic
- Compositional reasoning using intervals and time reversal
- A goal-directed decision procedure for hybrid PDL
- A survey on temporal logics for specifying and verifying real-time systems
- A decision procedure for propositional projection temporal logic with infinite models
- Definability and decidability of binary predicates for time granularity
- A general tableau method for propositional interval temporal logics: theory and implementation
- Partial cut elimination for propositional discrete linear time temporal logic
- An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
- Branching time? Pruning time!
- A sound and complete axiomatization for dynamic topological logic
- scientific article; zbMATH DE number 5955763 (Why is no real title available?)
- scientific article; zbMATH DE number 3871318 (Why is no real title available?)
- One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\)
- Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
- scientific article; zbMATH DE number 4170873 (Why is no real title available?)
- Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
- Invariant-free clausal temporal resolution
- scientific article; zbMATH DE number 5696770 (Why is no real title available?)
- Temporal Assertions with Parametrized Propositions
- Temporal Verification of Fault-Tolerant Protocols
- Linear-time temporal logics with Presburger constraints: an overview
- scientific article; zbMATH DE number 3937153 (Why is no real title available?)
- scientific article; zbMATH DE number 3943779 (Why is no real title available?)
- scientific article; zbMATH DE number 149521 (Why is no real title available?)
- scientific article; zbMATH DE number 1222565 (Why is no real title available?)
- Calendar Logic
- scientific article; zbMATH DE number 1301761 (Why is no real title available?)
- scientific article; zbMATH DE number 1304994 (Why is no real title available?)
- Completeness and decidability of tense logics closely related to logics above K4
- scientific article; zbMATH DE number 2015290 (Why is no real title available?)
- scientific article; zbMATH DE number 2084388 (Why is no real title available?)
- The intuitionistic temporal logic of dynamical systems
- Decidable temporal and sequential relevant logics*
- Interval vs. point temporal logic model checking. An expressiveness comparison
- Complete Proof System for QPTL
- Model Theoretic Syntax and Parsing
- Probabilistic Temporal Logics
- Complete intuitionistic temporal logics for topological dynamics
- A hierarchical completeness proof for propositional temporal logic
- Dynamic topological logic of metric spaces
- scientific article; zbMATH DE number 2196589 (Why is no real title available?)
- Axioms for real-time logics
- Exploring the Jungle of Intuitionistic Temporal Logics
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Completeness of a branching-time logic with possible choices
- Probabilistic temporal logic with countably additive semantics
- SAT meets tableaux for linear temporal logic satisfiability
- Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
- Gödel-Dummett linear temporal logic
- Model checking distributed temporal logic
- Tangled modal logic for topological dynamics
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms
- Cut-free sequent systems for temporal logic
This page was built for publication: Propositional temporal logics: decidability and completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444910)
