Indicative Conditionals and Dynamic Epistemic Logic

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal semantics and dynamic epistemic logic in this area can be of mutual benefit. In one direction, we show how concepts and tools from modal logic and dynamic epistemic logic can be used to give a simple, complete axiomatization of Yalcin's [16] semantic consequence relation for a language with epistemic modals and indicative conditionals. In the other direction, the formal semantics for indicative conditionals due to Kolodny and MacFarlane [9] gives rise to a new dynamic operator that is very natural from the point of view of dynamic epistemic logic, allowing succinct expression of dependence (as in dependence logic) or supervenience statements. We prove decidability for the logic with epistemic modals and Kolodny and MacFarlane's indicative conditional via a full and faithful computable translation from their logic to the modal logic K45.Comment: In Proceedings TARK 2017, arXiv:1707.0825

A formal analysis of the notion of preference between deductive arguments

In the last two decades, justification logic has addressed the problem of including justifications into the field of epistemic logic. Nevertheless, there is something that has not received enough attention yet: how epistemic agents might prefer certain justifications to others, in order to have better pieces of evidence to support a particular belief. In this work, we study the notion of preference between a particular kind of justifications: deductive arguments. For doing so, we have built a logic using tools from epistemic logic, justification logic and logics for belief dependence. According to our solution, the preferences of an epistemic agent between different deductive arguments can be reduced to other notions

How to Hintikkize a Frege

The paper deals with the main contribution of the Finnish logician Jaakko Hintikka: epistemic logic, in particular the 'static' version of the system based on the formal analysis of the concepts of knowledge and belief. I propose to take a different look at this philosophical logic and to consider it from the opposite point of view of the philosophy of logic. At first, two theories of meaning are described and associated with two competing theories of linguistic competence. In a second step, I draw the conclusion that Hintikka's epistemic logic constitutes a sort of internalisation of meaning, by the introduction of epistemic modal operators into an object language. In this respect, to view meaning as the result of a linguistic competence makes epistemic logic nothing less than a logic of unified meaning and understanding

Modal Linear Logic in Higher Order Logic, an experiment in Coq

The sequent calculus of classical modal linear logic KDT 4lin is coded in the higher order logic using the proof assistant COQ. The encoding has been done using two-level meta reasoning in Coq. KDT 4lin has been encoded as an object logic by inductively defining the set of modal linear logic formulas, the sequent relation on lists of these formulas, and some lemmas to work with lists.This modal linear logic has been argued to be a good candidate for epistemic applications. As examples some epistemic problems have been coded and proven in our encoding in Coq::the problem of logical omniscience and an epistemic puzzle: ’King, three wise men and five hats’

Reducing Validity in Epistemic ATL to Validity in Epistemic CTL

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corresponding system of CTL makes the techniques for automated deduction for that logic available for the handling of the apparently more complex system of ATL.Comment: In Proceedings SR 2013, arXiv:1303.007

Epistemic Logic with Partial Dependency Operator

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses decent expressivity and beautiful properties. Several interesting examples are provided, which highlight this logic's practical usage. The logic's bisimulation is then discussed, and we give a sound and strongly complete axiomatization for a sub-language of the logic