Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Ghari, Meghdad"'
Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification and on the
Externí odkaz:
http://arxiv.org/abs/2309.15763
Autor:
Ghari, Meghdad
We combine linear temporal logic (with both past and future modalities) with a deontic version of justification logic to provide a framework for reasoning about time and epistemic and normative reasons. In addition to temporal modalities, the resulti
Externí odkaz:
http://arxiv.org/abs/2109.10018
Autor:
Parsa, Amir Farahmand, Ghari, Meghdad
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 justification terms and equality predicate on terms. In the end, th
Externí odkaz:
http://arxiv.org/abs/2106.10931
Autor:
Ghari, Meghdad
In this paper we present various temporal justification logics involving both past and future time modalities. We combine Artemov's logic of proofs with linear temporal logic (with both past and future operators), and establish its soundness and comp
Externí odkaz:
http://arxiv.org/abs/1809.00167
Publikováno v:
EPTCS 243, 2017, pp. 59-74
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 moda
Externí odkaz:
http://arxiv.org/abs/1703.02195
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ghari, Meghdad
In this paper we present analytic tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntacti
Externí odkaz:
http://arxiv.org/abs/1606.03562
Autor:
Ghari, Meghdad
In this paper we present a tableau proof system for first order logic of proofs FOLP. We show that the tableau system is sound and complete with respect to Mkrtychev models of FOLP.
Externí odkaz:
http://arxiv.org/abs/1604.07021
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ghari, Meghdad
Justification Logics provide a framework for reasoning about justifications and evidences. Most of the accounts of justification logics are crisp in the sense that agent's justifications for a statement is convincing or is not. In this paper, we stud
Externí odkaz:
http://arxiv.org/abs/1407.4647