Decidability for justification logics revisited

DOI10.1007/978-3-642-36976-6_12MaRDI QIDQ4914518zbMATH OpenOpenAlexFDO

Authors Samuel Bucheli, Roman Kuznets, Thomas Studer

Publication date 12 April 2013

Published in Logic, Language, and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36976-6_12

zbMATH Keywords

decidabilityfiltrationjustification logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logics of knowledge and belief (including belief change) (03B42)

Recommendations

• Decidability for some justification logics with negative introspection
• The ontology of justifications in the logical setting
• Logics of proofs and justifications
• What are justification logics?
• Justifications for common knowledge

Cited in

(4)

• On the Complexity of Two-Agent Justification Logic
• Justification announcements in discrete time. Part II: Frame definability results
• Decidability for some justification logics with negative introspection
• Tableaux and interpolation for propositional justification logics

This page was built for publication: Decidability for justification logics revisited

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