01408nas a2200241 4500008004100000245005200041210005200093260001300145300001200158490000900170520073600179653001700915653001500932653002400947100002000971700001900991700001901010700002501029700002301054700002001077700001901097856005001116 2013 eng d00aDecidability for Justification Logics Revisited0 aDecidability for Justification Logics Revisited bSpringer a166-1810 v77583 aJustification logics are propositional modal-like logics that instead of statements \emph{$A$ is known} include statements of the form \emph{$A$ is known for reason $t$} where the term $t$ can represent an informal justification for $A$ or a formal proof of $A$. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in order to obtain decidability results. Apart from reproving already known results in a uniform way, we also prove new results. In particular, we use our submodel construction to establish decidability for a justification logic with common knowledge for which so far no decidability proof was available.10adecidability10afiltration10ajustification logic1 aBucheli, Samuel1 aKuznets, Roman1 aStuder, Thomas1 aBezhanishvili, Guram1 aLöbner, Sebastian1 aMarra, Vincenzo1 aRichter, Frank uhttp://www.iam.unibe.ch/ltgpub/2013/bks13.pdf