Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Artemov S., “Explicit provability and constructive semantics”, Bull. Symbol. Log., 7:1 (2001), 1–36 | DOI | MR | Zbl
[2] Mkrtychev A., “Models for the logic of proofs”, Logical Foundations of Computer Science, Int. Symp. LFCS'97, Lect. Notes Comput. Sci. Vol., 1234, eds. S. Adyan, A. Nerode, Springer, Cham, 1997, 266–275 | DOI | MR | Zbl
[3] Artemov S., Fitting M., Justification logic: Reasoning with reasons, Cambridge University Press, Cambridge, 2019 | MR | Zbl
[4] Artemov S., “Justification awareness models”, Logical Foundations of Computer Science, Int. Symp. LFCS 2018, Lect. Notes Comput. Sci., 10703, eds. S. Artemov, A. Nerode, Springer, Cham, 2018, 22–36 | DOI | MR | Zbl
[5] Krupski N., “On the complexity of the reflected logic of proofs”, Theor. Comput. Sci., 357:1–3 (2006), 136–142 | DOI | MR | Zbl