Justification logics are closely related to modal logics and can be viewed as a refinement of the later with machinery for justification manipulation. Justifications are represented directly in the language by terms that can be interpreted as formal proofs in a proof system, evidence for knowledge, winning strategy in a game, etc. This more expressive language proved beneficial in both proof theory and epistemology and helped investigate problems ranging from a provability semantics for intuitionistic logic to the logical omniscience problem. It has connections with intuitionistic logic, lambda calculus, epistemic logic, provability logic, and structural proof theory. Justification logic is a new and fast evolving field that offers unexpected results and insights into old problems. Its position at the junction of mathematics, philosophy, and computer science makes it of interest to a wide audience.
We plan to discuss the following topics:
The first lecture will take place on Tuesday, 18.09.2012 at 14:15 in UniBE, ExWi, room 119.
Requirements: Basic knowledge in logic and/or theoretical computer science
Link to the course page in ILIAS: https://ilias.unibe.ch/goto_ilias3_unibe_crs_447665.html