Decidability for some justification logics with negative introspection
From MaRDI portal
Recommendations
- Decidability for justification logics revisited
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
- Decidability of some classes of modal logic
- scientific article; zbMATH DE number 6863635
- scientific article; zbMATH DE number 5227710
- A general method for proving decidability of intuitionistic modal logics
- NEXP-completeness and universal hardness results for justification logic
- Lower complexity bounds in justification logic
- The internalized disjunction property for intuitionistic justification logic
- scientific article; zbMATH DE number 4185010
Cites work
- Explicit provability and constructive semantics
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- Justifications for common knowledge
- Logic of proofs and provability
- On Realization of -modality by Evidence Terms
- Reference Constructions in the Single-conclusion Proof Logic
- Referential logic of proofs
- The logic of justification
- The logic of proofs, semantically
- The single-conclusion proof logic and inference rules specification
Cited in
(10)- Explicit non-normal modal logic
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
- scientific article; zbMATH DE number 6863635 (Why is no real title available?)
- Decidability for justification logics revisited
- Justification Logics with Probability Operators
- A Conflict Tolerant Logic of Explicit Evidence
- Semirings of Evidence
- Conditional obligations in justification logic
- Tableaux and interpolation for propositional justification logics
- Explicit non-normal modal logic
This page was built for publication: Decidability for some justification logics with negative introspection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300069)