2008 | ||
---|---|---|
12 | EE | Ryo Kashima, Keishi Okamoto: General Models and Completeness of First-Order Modal µ-calculus. J. Log. Comput. 18(4): 497-507 (2008) |
11 | EE | Ryo Ishigaki, Ryo Kashima: Sequent Calculi for Some Strict Implication Logics. Logic Journal of the IGPL 16(2): 155-174 (2008) |
2005 | ||
10 | EE | Tatsuaki Okamoto, Ryo Kashima: Resource Bounded Unprovability of Computational Lower Bounds CoRR abs/cs/0503091: (2005) |
2003 | ||
9 | EE | Ichiro Hasuo, Ryo Kashima: Kripke Completeness of First-Order Constructive Logics with Strong Negation. Logic Journal of the IGPL 11(6): 615-646 (2003) |
8 | EE | Ryo Kashima: On semilattice relevant logics. Math. Log. Q. 49(4): 401-414 (2003) |
2001 | ||
7 | Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi: Sequent Calculi for Visser's Propositional Logics. Notre Dame Journal of Formal Logic 42(1): 1-22 (2001) | |
2000 | ||
6 | EE | Ryo Kashima: Completeness of Implicational Relevant Logics. Logic Journal of the IGPL 8(6): (2000) |
1999 | ||
5 | Ryo Kashima, Norihiro Kamide: Substructural Implicational Logics Including the Relevant Logic E. Studia Logica 63(2): 181-212 (1999) | |
1997 | ||
4 | Ryo Kashima: Contraction-Elimination for Implicational Logics. Ann. Pure Appl. Logic 84(1): 17-39 (1997) | |
3 | Takeshi Yamaguchi, Ryo Kashima: On the Dif%culty of Writing Out Formal Proofs in Arithmetic. Math. Log. Q. 43: 328-332 (1997) | |
1994 | ||
2 | Tatsuya Shimura, Ryo Kashima: Cut-Elimination Theorem for the Logic of Constant Domains. Math. Log. Q. 40: 153-172 (1994) | |
1 | Ryo Kashima: Cut-free sequent calculi for some tense logics. Studia Logica 53(1): 119-136 (1994) |
1 | Ichiro Hasuo | [9] |
2 | Ryo Ishigaki | [11] |
3 | Katsumasa Ishii | [7] |
4 | Norihiro Kamide | [5] |
5 | Kentaro Kikuchi | [7] |
6 | Keishi Okamoto | [12] |
7 | Tatsuaki Okamoto | [10] |
8 | Tatsuya Shimura | [2] |
9 | Takeshi Yamaguchi | [3] |