Decidability of logics based on an indeterministic metric tense logic

DOI10.1007/S11225-015-9613-4zbMATH Open1378.03018OpenAlexW1915651240MaRDI QIDQ897475FDOQ897475

Authors: Yan Zhang, Kai Li 

Publication date: 7 December 2015

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-015-9613-4

Recommendations

• scientific article; zbMATH DE number 759442
• Decidable metric logics
• Decidability results for metric and layered temporal logics
• Publication:4938638
• Relaxed decidability and the robust semantics of metric temporal logic
• On the decidability and complexity of Metric Temporal Logic over finite words
• Some Recent Results in Metric Temporal Logic
• Completeness and decidability of tense logics closely related to logics above K4
• A decidable intuitionistic temporal logic
• The Expressive Power of Temporal and First-Order Metric Logics

zbMATH Keywords

epistemic logicfiltrationlogic of agencystitbisimulationKripke structurefinite frame property

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cites Work

• Modal logic
• Complexity results of STIT fragments
• A mathematical introduction to logic.
• Properties of logics of individual and group agency
• A Logical Analysis of the Interaction between ‘Obligation-to-do’ and ‘Knowingly Doing’
• A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deontic epistemic stit logic distinguishing modes of mens rea
• Indeterminist time and truth‐value gaps¹
• Alternative axiomatics and complexity of deliberative STIT theories
• Model theory.
• Branching-time logic with quantification over branches: The point of view of modal logic
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Decidability of an Xstit logic
• A Gabbay-rule free axiomatization of \(T\times W\) validity

Cited In (2)

• Decidable metric logics
• Completeness and decidability of tense logics closely related to logics above K4

This page was built for publication: Decidability of logics based on an indeterministic metric tense logic

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