Mathematical Logic of Justification

Since Plato, the notion of justification has been an essential component of epistemic studies. However, until recently, the notion of justification has been conspicuously absent from mathematical models of knowledge within the epistemic logic framework. Commencing from seminal works by von Wright and Hintikka, the notions of Knowledge and Belief have acquired formalization by means of modal logic with modals ‘F is known’ and ‘F is believed.’ Within this approach, the following analysis was adopted: For a given agent, F is known ~ F holds in all epistemically possible situations. The deficiency of this approach is displayed most prominently, in the Logical Omniscience feature of the modal logic of knowledge.

Justification Logic had been anticipated by Goedel as the logic of explicit mathematical proofs and has been first developed as the Logic of Proofs. It introduces a mathematical notion of justification, making epistemic logic more expressive. We now have the capacity to reason about justifications, simple and compound. We can compare different pieces of evidence pertaining to the same fact. We can measure the complexity of justifications, which leads to a coherent theory of logical omniscience. Justification Logic provides a novel mechanism of evidence-tracking which seems to be a key ingredient in the analysis of knowledge. Finally, Justification Logic furnishes a new, evidence-based foundation for the logic of knowledge, according to which F is known ~ F has an adequate justification.

Speaker Details

Sergei Artemov is a Distinguished Professor of Computer Science, the founder and head of the Research Laboratory for Logic and Computation at the Graduate Center of the City University of New York. Professor Artemov’s professional interests are logic in computer science, epistemology, game theory, automated deduction and verification, and optimal control and hybrid systems. He has developed a Justification Logic that incorporates justifications into epistemic logic and renders its new, evidence-based foundation. His most recent project is in Game Theory where he has developed a theory of knowledge-based rational decisions in non-probabilistic settings.Professor Artemov has authored 140 research papers and supervised 21 Ph.D. dissertations. He is an editor of several journals and the organizer of a number of international conferences, including the symposium series Logical Foundations of Computer Science. He has delivered a Distinguished Lecture for the New York Academy of Sciences, Clifford Lectures, the Spinoza Lecture for the European Association for Computer Science Logic, the keynote lecture for the Kurt Gödel Society in Vienna.

Date:
Speakers:
Sergei Artemov
Affiliation:
Graduate Center of the City University of New York
    • Portrait of Jeff Running

      Jeff Running