Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
From MaRDI portal
Publication:606997
DOI10.1016/j.tcs.2010.09.012zbMath1209.03011OpenAlexW2082356974MaRDI QIDQ606997
Vladimir Vladimirovich Rybakov
Publication date: 19 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.012
Related Items (4)
On rules ⋮ Tutorial on Admissible Rules in Gudauri ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logical equations and admissible rules of inference with parameters in modal provability logics
- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- Complexity of admissible rules
- 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
- Linear temporal logic with until and next, logical consecutions
- Proof theory for admissible rules
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- Equations in free topoboolean algebra
- Derivability of admissible 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
- Best solving modal equations
- On the admissible rules of intuitionistic propositional logic
- Construction of an Explicit Basis for Rules Admissible in Modal System S4
- 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
- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
- The complexity of propositional linear temporal logics
- Rules of inference with parameters for intuitionistic logic
- One hundred and two problems in mathematical logic
- Unification in intuitionistic logic
- Admissible and derivable rules in intuitionistic logic
- Propositional temporal logics: decidability and completeness
- The computational complexity of hybrid temporal logics
- On Finite Model Property for Admissible Rules
- An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
- Undecidability of the unification and admissibility problems for modal and description logics
- Filtering unification and most general unifiers in modal logic
- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
- Logical consecutions in discrete linear temporal logic
- An algebraic study of tense logics with linear time
- Note on a paper in tense logic
- Admissible Rules of Modal Logics
This page was built for publication: Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
