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
From MaRDI portal
Publication:929294
DOI10.1007/s00224-007-9059-9zbMath1148.03011MaRDI QIDQ929294
Vladimir Vladimirovich Rybakov
Publication date: 17 June 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9059-9
Algorithms; Decidability; Temporal logic; Admissible consecutions; Branching time logic; Inference rules; Linear temporal logic; Logical consecutions
03B70: Logic in computer science
03B25: Decidability of theories and sets of sentences
03B44: Temporal logic
Related Items
Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements, Decidability: theorems and admissible rules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- Derivability of admissible rules
- Admissibility of logical inference rules
- Mathematical modal logic: A view of its evolution
- The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
- Advances in temporal logic. Selected papers of the 2nd international conference on temporal logic, ICTL, Manchester, UK, 1997
- On the admissible rules of intuitionistic propositional logic
- A quick axiomatisation of LTL with past
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
- The complexity of propositional linear temporal logics
- Modal sequents and definability
- Using the Universal Modality: Gains and Questions
- Rules of inference with parameters for intuitionistic logic
- One hundred and two problems in mathematical logic
- Unification in intuitionistic logic
- Propositional temporal logics: decidability and completeness
- On Finite Model Property for Admissible Rules
- An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
- Hereditarily structurally complete modal logics
- Logical consecutions in discrete linear temporal logic
- Admissible Rules of Modal Logics
