Normalization of Terms in Sharp Models of Logic of Proofs LP
-
Published:2023-12
Issue:6
Volume:78
Page:309-312
-
ISSN:0027-1322
-
Container-title:Moscow University Mathematics Bulletin
-
language:en
-
Short-container-title:Moscow Univ. Math. Bull.
Reference5 articles.
1. S. N. Artemov, ‘‘Explicit provability and constructive semantics,’’ Bull. Symbolic Logic 7, 1–36 (2001). https://doi.org/10.2307/2687821
2. A. Mkrtychev, ‘‘Models for the logic of proofs,’’ in Logical Foundations of Computer Science, Ed. by S. Adyan and A. Nerode, Lecture Notes in Computer Science, Vol. 1234 (Springer, Cham, 1997), pp. 266–275. https://doi.org/10.1007/3-540-63045-7_27
3. S. Artemov and M. Fitting, Justification Logic: Reasoning with Reasons, Cambridge Tracts in Mathematics, Vol. 216 (Cambridge Univ. Press, Cambridge, 2019). https://doi.org/10.1017/9781108348034
4. S. Artemov, ‘‘Justification awareness models,’’ in Logical Foundations of Computer Science, Ed. by S. Artemov and A. Nerode, Lecture Notes in Computer Science, Vol. 10703 (Springer, Cham, 2018), pp. 22–36. https://doi.org/10.1007/978-3-319-72056-2_2
5. N. V. Krupski, ‘‘On the complexity of the reflected logic of proofs,’’ Theor. Comput. Sci. 357, 136–142 (2006). https://doi.org/10.1016/j.tcs.2006.03.015