Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Kashima, Ryo"'
We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and $t_\omega$ t
Externí odkaz:
http://arxiv.org/abs/2310.16369
Autor:
Kashima, Ryo, Kato, Yutaka
The quasi-normal modal logic GLS is a provability logic formalizing the arithmetical truth. Kushida (2020) gave a sequent calculus for GLS and proved the cut-elimination theorem. This paper introduces semantical characterizations of GLS and gives a s
Externí odkaz:
http://arxiv.org/abs/2309.05948
Autor:
Okamoto, Tatsuaki, Kashima, Ryo
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P not= NP (mor
Externí odkaz:
http://arxiv.org/abs/cs/0503091
Autor:
Kashima, Ryo
Publikováno v:
数理解析研究所講究録. 2233:65-81
Autor:
Kato, Zenta, Kashima, Ryo, Tatsumi, Kohei, Fukuyama, Shinnosuke, Izumiya, Koichi, Kumagai, Naokazu, Hashimoto, Koji
Publikováno v:
In Applied Surface Science 1 December 2016 388 Part B:640-644
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 2015 Dec 01. 103(6), 1225-1244.
Externí odkaz:
http://www.jstor.org/stable/43651804
Autor:
Takagi, Kento1 (AUTHOR) kento.takagi.aa@gmail.com, Kashima, Ryo1 (AUTHOR) kashima@is.titech.ac.jp
Publikováno v:
Mathematical Logic Quarterly. Dec2020, Vol. 66 Issue 4, p438-447. 10p.
Autor:
Kashima, Ryo, Kamide, Norihiro
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 1999 Sep 01. 63(2), 181-212.
Externí odkaz:
https://www.jstor.org/stable/20016083
Autor:
Nakamura, Kazuki, Kashima, Ryo
Publikováno v:
数理解析研究所講究録. 2083:156-166
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.