Switch to: References

Citations of:

Pavelka-style fuzzy justification logics

Logic Journal of the IGPL 24 (5):743-773 (2016)

Add citations

You must login to add citations.

Probabilistic Justification Logic.Joseph Lurie - 2018 - Philosophies 3 (1):2.details Justification logics are constructive analogues of modal logics. They are often used as epistemic logics, particularly as models of evidentialist justification. However, in this role, justification (and modal) logics are defective insofar as they represent justification with a necessity-like operator, whereas actual evidentialist justification is usually probabilistic. This paper first examines and rejects extant candidates for solving this problem: Milnikel’s Logic of Uncertain Justifications, Ghari’s Hájek–Pavelka-Style Justification Logics and a version of probabilistic justification logic developed by Kokkinis et al. It (...) Download Export citation Bookmark 1 citation
Natural deduction and semantic models of justification logic in the proof assistant Coq.Jesús Mauricio Andrade Guzmán & Francisco Hernández Quiroz - forthcoming - Logic Journal of the IGPL.details The purpose of this paper is to present a formalization of the language, semantics and axiomatization of justification logic in Coq. We present proofs in a natural deduction style derived from the axiomatic approach of justification logic. Additionally, we present possible world semantics in Coq based on Fitting models to formalize the semantic satisfaction of formulas. As an important result, with this implementation, it is possible to give a proof of soundness for $\mathsf{L}\mathsf{P}$ with respect to Fitting models. Download Export citation Bookmark
On intermediate justification logics.Nicholas Pischke - forthcoming - Logic Journal of the IGPL.details We study arbitrary intermediate propositional logics extended with a collection of axioms from justification logics. For these, we introduce various semantics by combining either Heyting algebras or Kripke frames with the usual semantic machinery used by Mkrtychev’s, Fitting’s or Lehmann and Studer’s models for classical justification logics. We prove unified completeness theorems for all intermediate justification logics and their corresponding semantics using a respective propositional completeness theorem of the underlying intermediate logic. Further, by a modification of a method of Fitting, (...) Download Export citation Bookmark
Gödel justification logics and realization.Nicholas Pischke - 2022 - Logic Journal of the IGPL 30 (3):343-408.details We study the topic of realization from classical justification logics in the context of the recently introduced Gödel justification logics. We show that the standard Gödel modal logics of Caicedo and Rodriguez are not realized by the Gödel justification logics and moreover, we study possible extensions of the Gödel justification logics, which are strong enough to realize the standard Gödel modal logics. On the other hand, we study the fragments of the standard Gödel modal logics, which are realized by the (...) Download Export citation Bookmark 2 citations
A Note on Strong Axiomatization of Gödel Justification Logic.Nicholas Pischke - 2020 - Studia Logica 108 (4):687-724.details Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators “t : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these operators, one can therefore not only reason about modal effects on propositions but also about dynamics inside the justifications themselves. We (...) Download Export citation Bookmark 3 citations
On Boolean Algebraic Structure of Proofs: Towards an Algebraic Semantics for the Logic of Proofs.Amir Farahmand Parsa & Meghdad Ghari - 2023 - Studia Logica 111 (4):573-613.details We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on proof terms and equality predicate on terms. Moreover, the completeness theorem and certain generalizations of Stone’s representation theorem are obtained for all proposed algebras. Download Export citation Bookmark
Temporal Justification Logic.S. Bucheli, M. Ghari & T. Studer - 2017 - Proceedings of the Ninth Workshop on Methods for Modalities (M4M9 2017), Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017, Electronic Proceedings in Theoretical Computer Science 243, Pages 59–74.details Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic. Download Export citation Bookmark 1 citation

1