Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Joost J Joosten"'
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
Publikováno v:
The Journal of Symbolic Logic. :1-26
Vardanyan’s Theorems [36, 37] state that $\mathsf {QPL}(\mathsf {PA})$ —the quantified provability logic of Peano Arithmetic—is $\Pi ^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a523c8da86e8fa4a3015b71f94bba71
https://doi.org/10.1017/jsl.2022.38
https://doi.org/10.1017/jsl.2022.38
Publikováno v:
Advances in Mathematical Physics, Vol 2016 (2016)
We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machine τ and any particular input x, we consider what we call the space-time diagram which is basically
Externí odkaz:
https://doaj.org/article/ffde989bd56d4d6f9d80bcbe25fbca8d
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:
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
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, Félix Bou
In this paper from 2011 we consider $\textbf{IL}_0$, the closed fragment of the basic interpretability logic $\textbf{IL}$. We show that we can translate $\textbf{GL}_1$, the one variable fragment of G\"odel-L\"ob's provabilty logic $\textbf{GL}$, in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e10a486cedeb93bf9c2c5310a34700d
http://arxiv.org/abs/2004.06398
http://arxiv.org/abs/2004.06398
Autor:
Joost J. Joosten, Eduardo Hermo Reyes
Publikováno v:
Notre Dame J. Formal Logic 61, no. 1 (2020), 155-180
El objetivo de esta tesis es desarrollar herramientas de logica modal que puedan ser utilizadas en el campo de la teoria de la demostracion y el analisis ordinal. Mas precisamente, nos centramos en la relacion entre las logicas modales estrictamente
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc0af7f99bff43de6866db984206de2f
https://doi.org/10.1215/00294527-2019-0037
https://doi.org/10.1215/00294527-2019-0037
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:
David Fernández-Duque, Joost J. Joosten, Ana de Almeida Borges, Mireia González Bedmar, Juan José Conejero Rodríguez
Publikováno v:
Information and Computation. 280:104636
This paper analyses a selection of articles from European transport regulations that contain algorithmic information, but may be problematic to implement. We focus on issues regarding the interpretation of tachograph data and requirements on weekly r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dbc0a6fe0efda00f4bcef643d31ec73
https://doi.org/10.1016/j.ic.2020.104636
https://doi.org/10.1016/j.ic.2020.104636