Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Konstantinos Papafilippou"'
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783030930998
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32335dcb7e93611fa6073173f03f3f01
https://doi.org/10.1007/978-3-030-93100-1_5
https://doi.org/10.1007/978-3-030-93100-1_5
Autor:
David FernÁndez-Duque, Joost J Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weierman
Japaridze's provability logic $GLP$ has one modality $[n]$ for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic $(PA)$ and related theories. Among other benefits, this analysis yields the so-calle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa50cb1ad46d4d391d126744c327522c