A note on strong axiomatization of Gödel justification logic (Q2193971)

The paper under review is concerned with fuzzy analogues of certain justification logics. In particular, it discusses systems of justification logics whose underlying logic is the infinite-valued Gödel logic. Kripke-Fitting-style semantics are provided for these logics. The interesting feature of the proposed semantics is that instead of the crisp (i.e. two-valued) accessibility relations which are generally used in the possible world semantics of justification logics, it employs fuzzy accessibility relations that takes values in the standard Gödel algebra [0,1]. It is worth noting that the previous work on fuzzy justification logic [Log. J. IGPL 24, No. 5, 743--773 (2016; Zbl 1405.03040)] deals mainly with models that have crisp accessibility relations. In that paper, \textit{M. Ghari} shows that in a Łukasiewicz t-norm based justification logic the application axiom is not valid in the class of (standard) fuzzy Kripke-Fitting models with fuzzy accessibility relation. Several standard theorems in the literature of both fuzzy logic and justification logic are mentioned. These include the strong completeness theorem, the internalization property, the conservativity of Gödel justification logics over Gödel logic, and the finite model property. The proof of completeness follows the same strategy used by \textit{X. Caicedo} and \textit{R. O. Rodriguez} [Stud. Log. 94, No. 2, 189--214 (2010; Zbl 1266.03030)] for Gödel modal logic. Moreover, the completeness theorem is proved with respect to two classes of models: models with crisp accessibility relation and models with fuzzy accessibility relation. Finally, the author takes advantage of the infinitely valued fuzzy accessibility relations to resolve a sorites-style argument that models with crisp accessibility relations are not capable to formalize it.