Logical consecutions in discrete linear temporal logic
From MaRDI portal
Publication:5486245
DOI10.2178/jsl/1129642119zbMath1110.03010OpenAlexW2093974031MaRDI QIDQ5486245
Vladimir Vladimirovich Rybakov
Publication date: 6 September 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1129642119
Related Items
Intransitive Temporal Multi-agent’s Logic, Knowledge and Uncertainty, Plausibility ⋮ Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements ⋮ Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge ⋮ Unnamed Item ⋮ Multi-agent logics with dynamic accessibly relations, projective unifiers ⋮ Temporal multi-valued logic with lost worlds in the past ⋮ Many-valued multi-modal logics, satisfiability problem ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ KD is nullary ⋮ Formulas expressing totally nonstable truth values of formulas ⋮ Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL ⋮ Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms ⋮ Admissibility and unification in the modal logics related to S4.2 ⋮ 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 ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ Linear temporal logic with until and next, logical consecutions ⋮ Inference Rules in Multi-agents’ Temporal Logics ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Branching time logics with multiagent temporal accessibility relations ⋮ Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility ⋮ Decidability: theorems and admissible rules ⋮ Canonical rules ⋮ Temporal logic with accessibility temporal relations generated by time states themselves ⋮ Branching time agents logics, satisfiability problem by rules in reduced form ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
Cites Work
- 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
- Refined common knowledge logics or logics of common information
- Many-dimensional modal logics: theory and applications
- Construction of an Explicit Basis for Rules Admissible in Modal System S4
- ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
- Unification in intuitionistic logic
- On Finite Model Property for Admissible Rules
- A(nother) characterization of intuitionistic propositional logic
