Results 1 to 10 of about 902,991 (274)
Temporal Justification Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms.
Samuel Bucheli +2 more
doaj +10 more sources
Probabilistic Justification Logic [PDF]
Philosophies, 2018 Justification logics are constructive analogues of modal logics. They are often used as epistemic logics, particularly as models of evidentialist justification.
Joseph Lurie
doaj +4 more sources
Subset Models for Justification Logic [PDF]
Lecture Notes in Computer Science, 2019 We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new justification logic that is sound and complete with respect to our semantics.
Thomas Studer, Eveline Lehmann
exaly +6 more sources
Justification Logic for Intuitionistic Modal Logic [PDF]
Lecture Notes in Computer ScienceAbstract Justification logic is an explication of modal logic: boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system for a modal logic, e.g., using sequent, hypersequent, or nested sequent calculi.
Sonia Marin, Paaras Padhiar
exaly +3 more sources
Rosenkranz’s Logic of Justification and Unprovability [PDF]
Journal of Philosophical Logic, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan Heylen
exaly +4 more sources
The logic of epistemic justification [PDF]
SynthÈse, 2017 Theories of epistemic justification are commonly assessed by exploring their predictions about particular hypothetical cases-predictions as to whether justification is present or absent in this or that case. With a few exceptions, it is much less common for theories of epistemic justification to be assessed by exploring their predictions about logical ...
exaly +4 more sources
A Complexity Question in Justification Logic
Lecture Notes in Computer Science, 2011 Bounds for the computational complexity of major justification logics were found in papers by Buss, N. Krupski, Kuznets, and Milnikel: logics J, J4, JT, LP and JD, were established to be Σp2 -complete. A corresponding lower bound is also known for JD4, the system that includes the consistency axiom and positive introspection.
Antonis Achilleos
exaly +3 more sources
An Application of Justification Logic to Protocol Verification [PDF]
2011 Seventh International Conference on Computational Intelligence and Security, 2011 Recently, Tsukada et al. propose to use multi-agent epistemic logic for a taxonomy of information-hiding/disclosure properties, in particular properties used in authentication protocols. We follow their proposal and introduce a new multi-agent justification logic for protocol analysis and verification.
Thomas Studer
exaly +4 more sources
An Account of How to Apply Epistemological Issues to Practical Doctrines of Islamic Jurisprudence [PDF]
پژوهشنامه فلسفه دین, 2022 There is a direct connection between the popularity of the doctrines of every religion and the logic of deduction in it. Accordingly, the functionality of Islamic jurisprudence as the most considerable Islamic knowledge, depends on its ability to answer ...
Mohammad Hosein Safaei
doaj +1 more source
Dretske on Closure of Knowledge and Its Rereading in Justification Logic [PDF]
حکمت و فلسفه, 2020 The K axiom in the logic of knowledge expresses this epistemological approach that knowledge is closed under known implications. For Dretske, for two reasons, the closure of knowledge cannot be tautology: first, the knowledge operator does not penetrate ...
Masoud Alvand
doaj +1 more source