Rules admissible in transitive temporal logic T_S4, sufficient condition
From MaRDI portal
Publication:606997
Recommendations
- Intransitive linear temporal logic based on integer numbers, decidability, admissible logical consecutions
- Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics
- scientific article; zbMATH DE number 3959387
- A tableau method for checking rule admissibility in S4
- Logical consecutions in discrete linear temporal logic
Cites work
- scientific article; zbMATH DE number 1670842 (Why is no real title available?)
- scientific article; zbMATH DE number 3112788 (Why is no real title available?)
- scientific article; zbMATH DE number 5640556 (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 1223729 (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?)
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Admissible Rules of Modal Logics
- Admissible and derivable rules in intuitionistic logic
- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
- An algebraic study of tense logics with linear time
- Bases of admissible rules of the logics S4 and Int
- Best solving modal equations
- 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
- Complexity of admissible rules
- 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
- Equations in free topoboolean algebra
- Filtering unification and most general unifiers in modal logic
- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
- Linear temporal logic with until and next, logical consecutions
- Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
- Logical consecutions in discrete linear temporal logic
- Logical equations and admissible rules of inference with parameters in modal provability logics
- Mathematical modal logic: A view of its evolution
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- Note on a paper in tense logic
- On Finite Model Property for Admissible Rules
- On the admissible rules of intuitionistic propositional logic
- One hundred and two problems in mathematical logic
- Proof theory for admissible rules
- Propositional temporal logics: decidability and completeness
- Rules of inference with parameters for intuitionistic logic
- The complexity of propositional linear temporal logics
- The computational complexity of hybrid temporal logics
- The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
- Undecidability of the unification and admissibility problems for modal and description logics
- Unification in intuitionistic logic
- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
Cited in
(6)- Inference rules in Nelson's logics, admissibility and weak admissibility
- On rules
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- scientific article; zbMATH DE number 2097569 (Why is no real title available?)
- A useful four-valued extension of the temporal logic \(\mathsf{K}_{\mathsf t}\mathsf{T4}\)
- Tutorial on admissible rules in Gudauri
This page was built for publication: Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606997)
