Decidability: theorems and admissible rules

DOI10.3166/JANCL.18.293-308zbMath1181.03016OpenAlexW2050450965MaRDI QIDQ3643317

Vladimir Vladimirovich Rybakov

Publication date: 11 November 2009

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.18.293-308

zbMATH Keywords

logical consequenceadmissible rulesinference rulestemporal logicsdecision algorithmsmulti-modal logicslogics with universal modality

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (1)

Dynamic modalities

Cites Work

• Unnamed Item
• Reasoning about common knowledge with infinitely many agents
• Dynamic extensions of arrow logic
• Multi-agent dynamic logics with informational test
• 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
• 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
• Introducing Justification into Epistemic Logic
• Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
• Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
• Using the Universal Modality: Gains and Questions
• Logical consecutions in discrete linear temporal logic

This page was built for publication: Decidability: theorems and admissible rules