Branching time logics BTL^U,S_N,N^-1( Z)_ with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms

DOI10.1007/S00224-007-9059-9MaRDI QIDQ929294zbMATH OpenOpenAlexFDO

Authors Vladimir 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

zbMATH Keywords

Admissible consecutionsAlgorithmsBranching time logicDecidabilityInference rulesLinear temporal logicLogical consecutionsTemporal logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
• Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
• scientific article; zbMATH DE number 4006233
• scientific article; zbMATH DE number 4119600
• The temporal logic of branching time

Cites work

• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• A quick axiomatisation of LTL with past
• Admissibility of logical inference rules
• Admissible Rules of Modal Logics
• Advances in temporal logic. Selected papers of the 2nd international conference on temporal logic, ICTL, Manchester, UK, 1997
• An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
• Bases of admissible rules of the logics S4 and Int
• Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
• Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata
• Construction of an explicit basis for rules admissible in modal system S4
• Derivability of admissible rules
• Hereditarily structurally complete modal logics
• scientific article; zbMATH DE number 1670842 (Why is no real title available?)
• scientific article; zbMATH DE number 3115105 (Why is no real title available?)
• scientific article; zbMATH DE number 3821688 (Why is no real title available?)
• scientific article; zbMATH DE number 4033710 (Why is no real title available?)
• scientific article; zbMATH DE number 747023 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 1114355 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 2079050 (Why is no real title available?)
• scientific article; zbMATH DE number 1463088 (Why is no real title available?)
• scientific article; zbMATH DE number 2102708 (Why is no real title available?)
• scientific article; zbMATH DE number 2102710 (Why is no real title available?)
• Logical consecutions in discrete linear temporal logic
• Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
• Mathematical modal logic: A view of its evolution
• Modal sequents and definability
• On Finite Model Property for Admissible Rules
• On the admissible rules of intuitionistic propositional logic
• One hundred and two problems in mathematical logic
• Propositional temporal logics: decidability and completeness
• Rules of inference with parameters for intuitionistic logic
• The complexity of propositional linear temporal logics
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
• Unification in intuitionistic logic
• Using the Universal Modality: Gains and Questions

Cited in

(6)

• Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
• Decidability: theorems and admissible rules
• Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
• Decidability w.r.t. logical consecutions of linear temporal logic extended by Since and Previous
• 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

This page was built for publication: 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

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