Ryo Kashima

Research interest

• Mathematical logic, especially proof theoretical studies of nonclassical logics.

Publications

• Ryo Kashima: An axiomatization of ECTL, Journal of Logic and Computation (to be published), doi:10.1093/logcom/ext005
• Ryo Kashima: Completeness of Hilbert-style axiomatization for the extended computation tree logic ECTL, Research Reports on Mathematical and Computing Sciences, C-279, (Tokyo Institute of Technology, 2012). pdf file
• Ryo Kashima: Completeness proof by semantic diagrams for transitive closure of accessibility relation, Advances in Modal Logic, Volume 8, pp. 200-217 (2010).
• Ryo Kashima: A proof of the completeness theorem for the modal logic with transitive closure of accessibility relation, Research Reports on Mathematical and Computing Sciences, C-266, (Tokyo Institute of Technology, 2009). pdf file
• Ryo Kashima and Keishi Okamoto: General Models and Completeness of First-Order Modal mu-calculus, Journal of Logic and Computation 18[4], pp.497-507 (2008).
• Ryo Ishigaki and Ryo Kashima: Sequent Calculi for Some Strict Implication Logics, Logic Journal of the IGPL 16[2], pp.155-174 (2008).
• Ryo Kashima and Keishi Okamoto: Completeness Theorem of First-Order Modal mu-calculus, Research Reports on Mathematical and Computing Sciences, C-244, (Tokyo Institute of Technology, 2007). pdf file
• Ichiro Hasuo and Ryo Kashima: Kripke Completeness of First-Order Constructive Logics with Strong Negation, Logic Journal of the Interest Group in Pure and Applied Logics 11[6], pp.615-646 (2003).
• Katsumasa Ishii, Ryo Kashima, and Kentaro Kikuchi: Sequent Calculi for Visser's Propositional Logics, Notre Dame Journal of Formal Logic 42[1], 1-22 (2001) (published 2003).
• Ryo Kashima: On Semilattice Relevant Logics, Mathematical Logic Quarterly 49[4], 401-414 (2003).
• Ryo Kashima: Proof Theoretical Studies on Semilattice Relevant Logics, Research Reports on Mathematical and Computing Sciences, C-157, (Tokyo Institute of Technology, 2001). pdf file
• Ryo Kashima: On the Standardization Theorem for Lambda-Beta-Eta-Calculus, International Workshop on Rewriting in Proof and Computation (RPC'01), (Sendai, Japan. October 2001). pdf file
• Ryo Kashima: Completeness of Implicational Relevant Logics, Logic Journal of the Interest Group in Pure and Applied Logics 8, pp.761-785 (2000).
• Ryo Kashima: A Proof of the Standardization Theorem in Lambda-Calculus, Research Reports on Mathematical and Computing Sciences, C-145, (Tokyo Institute of Technology, 2000). pdf file
• Ryo Kashima: Labelled sequent calculi and completeness theorems for implicational relevant logics, Research Reports on Mathematical and Computing Sciences, C-140, (Tokyo Institute of Technology, 1999). pdf file
• Ryo Kashima and Norihiro Kamide: Substructural Implicational Logics Including the Relevant Logic E, Studia Logica 63 pp.181-212 (1999).
• Ryo Kashima and Takeshi Yamaguchi: On the Difficulty of Writing Out Formal Proofs in Arithmetic, Mathematical Logic Quarterly 43 pp.328-332 (1997).
• Ryo Kashima: Contraction-Elimination for Implicational Logics, Annals of Pure and Applied Logic 84, pp.17-39, (1997).
• Ryo Kashima: Cut-Free Sequent Calculi for Some Tense Logics, Studia Logica 53 pp.119-135 (1994).
• Ryo Kashima and Tatsuya Shimura: Cut-Elimination Theorem for the Logic of Constant Domains, Mathematical Logic Quarterly 40 pp.153-172 (1994).
• Ryo Kashima and Yuichi Komori: The Word Problem for Free BCI-Algebras Is Decidable, Mathematica Japonica 37 No.6 pp.1025-1029 (1992).
• Ryo Kashima: Cut-Elimination Theorem for the Intermediate Logic CD, Research Reports on Mathematical and Computing Sciences, C-100, (Tokyo Institute of Technology, 1991). pdf file