The following pages link to (Q4376067):
Displaying 50 items.
- Modal logics, justification logics, and realization (Q286591) (← links)
- Labeled sequent calculus for justification logics (Q331048) (← links)
- Multi-agent justification logic: communication and evidence elimination (Q375307) (← links)
- Possible world semantics for first-order logic of proofs (Q392284) (← links)
- The logic of uncertain justifications (Q392291) (← links)
- Self-referentiality of Brouwer-Heyting-Kolmogorov semantics (Q392298) (← links)
- Conservativity for logics of justified belief: two approaches (Q408535) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- The ontology of justifications in the logical setting (Q454364) (← links)
- On non-self-referential fragments of modal logics (Q508827) (← links)
- From the knowability paradox to the existence of proofs (Q625705) (← links)
- Justification logics and hybrid logics (Q631081) (← links)
- A modal provability logic of explicit and implicit proofs (Q636278) (← links)
- The logic of proofs, semantically (Q703832) (← links)
- Propositional games with explicit strategies (Q731893) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Interacting explicit evidence systems (Q929292) (← links)
- Logic of proofs with substitution (Q941919) (← links)
- Self-referential justifications in epistemic logic (Q987374) (← links)
- Justification logics, logics of knowledge, and conservativity (Q1028642) (← links)
- On arithmetical completeness of the logic of proofs (Q1625591) (← links)
- Prehistoric graph in modal derivations and self-referentiality (Q1678748) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- Structured argumentation dynamics. Undermining attacks in default justification logic (Q2075383) (← links)
- A note on strong axiomatization of Gödel justification logic (Q2193971) (← links)
- Justification logic with confidence (Q2193973) (← links)
- Distributed knowledge justification logics (Q2254486) (← links)
- An analytic calculus for the intuitionistic logic of proofs (Q2330501) (← links)
- A complexity question in justification logic (Q2453576) (← links)
- A quantified logic of evidence (Q2478547) (← links)
- Justified common knowledge (Q2500478) (← links)
- Making knowledge explicit: how hard it is (Q2500480) (← links)
- On the complexity of the reflected logic of proofs (Q2500485) (← links)
- Justifications for common knowledge (Q2901206) (← links)
- Simple Evidence Elimination in Justification Logic (Q2902944) (← links)
- The Logic of Justification (Q2971696) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- Topological Semantics of Justification Logic (Q3503622) (← links)
- S4LP and Local Realizability (Q3503636) (← links)
- THE LOGIC OF JUSTIFICATION (Q3580683) (← links)
- Tracking Evidence (Q3585997) (← links)
- Reasoning with Justifications (Q3600565) (← links)
- Conservativity for Logics of Justified Belief (Q3605540) (← links)
- Justification Logics with Probability Operators (Q5024719) (← links)
- A Logic of Knowledge and Belief Based on Abstract Arguments (Q5098746) (← links)
- The Minimal System of Justification Logic with Names (Q5213663) (← links)
- Possibilistic Justification Logic (Q5278213) (← links)
- Probabilistic Justification Logic (Q5283426) (← links)
- Symmetric Logic of Proofs (Q5452174) (← links)
