Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Evan Goris"'
Publikováno v:
Mathematical Logic Quarterly. 68:352-374
The notion of a critical successor in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28a226910be01237b0f9db827d63dcc8
https://doi.org/10.1002/malq.202200015
https://doi.org/10.1002/malq.202200015
Autor:
Evan Goris, Joost J. Joosten
Publikováno v:
Dipòsit Digital de la UB
Universidad de Barcelona
Universidad de Barcelona
The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::570261df44f960be2ffeb6d5c8f00af6
https://doi.org/10.1017/jsl.2019.90
https://doi.org/10.1017/jsl.2019.90
Autor:
Joost J. Joosten, Evan Goris
The interpretability logic of a mathematical theory describes the structural behavior of interpretations over that theory. Different theories have different logics. This paper from 2011 revolves around the question what logic describes the behavior t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75771510b759b19b65228a25653769da
http://arxiv.org/abs/2004.06902
http://arxiv.org/abs/2004.06902
Autor:
Joost J. Joosten, Evan Goris
This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this method, we obtai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::796a0b20409943c60937f19018a9abdc
Autor:
Evan Goris
Publikováno v:
Annals of Pure and Applied Logic. 161:388-403
We establish the bi-modal forgetful projection of the Logic of Proofs and Formal Provability GLA . That is to say, we present a normal bi-modal provability logic with modalities □ and ⊠ whose theorems are precisely those formulas for which the im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e316ebc42932f5cc60590e08ce0e4fab
https://doi.org/10.1016/j.apal.2009.07.020
https://doi.org/10.1016/j.apal.2009.07.020
Autor:
Evan Goris, Joost J. Joosten
Publikováno v:
Logic Journal of IGPL. 16:371-412
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b581ab9cb0fadbf64e8fb3c2c4c97b0c
https://doi.org/10.1093/jigpal/jzn013
https://doi.org/10.1093/jigpal/jzn013
Autor:
Evan Goris
Publikováno v:
Theory of Computing Systems. 43:185-203
This paper presents a semantics for the logic of proofs $\mathsf{LP}$ in which all the operations on proofs are realized by feasibly computable functions. More precisely, we will show that the completeness of $\mathsf{LP}$ for the semantics of proofs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f084241a318225e47b55db68da96ab26
https://doi.org/10.1007/s00224-007-9058-x
https://doi.org/10.1007/s00224-007-9058-x
Autor:
Evan Goris
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783540727323
LFCS
LFCS
In this paper we answer the question what implicit proof assertions in the provability logic GL can be realized by explicit proof terms. In particular we show that the fragment of GL which can be realized by generalized proof terms of GLA is exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46c85f31a97985e1af7bba6d294e5b4a
https://doi.org/10.1007/978-3-540-72734-7_17
https://doi.org/10.1007/978-3-540-72734-7_17
Autor:
Evan Goris
Publikováno v:
Notre Dame J. Formal Logic 47, no. 2 (2006), 179-195
In this paper we will be concerned with the interpretability logic of PA and in particular with the fact that this logic, which is denoted by ILM, does not have the interpolation property. An example for this fact seems to emerge from the fact that I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6923a7dd02a3555898b6cf37c1592250
https://doi.org/10.1305/ndjfl/1153858645
https://doi.org/10.1305/ndjfl/1153858645
Autor:
Evan Goris
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783540341666
CSR
CSR
The logic of proofs is known to be complete for the semantics of proofs in Peano Arithmetic PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the operations on proofs can be realized by feasible, that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f1305d7bae8920ed9cd1966716360df
https://doi.org/10.1007/11753728_21
https://doi.org/10.1007/11753728_21