Search the dblp DataBase

Publications of Author

1. Ryo Kashima
   Contraction-Elimination for Implicational Logics. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:17-39 [Journal]
   
2. Ichiro Hasuo, Ryo Kashima
   Kripke Completeness of First-Order Constructive Logics with Strong Negation. [Citation Graph (0, 0)][DBLP]
   Logic Journal of the IGPL, 2003, v:11, n:6, pp:615-646 [Journal]
   
3. Ryo Kashima
   Completeness of Implicational Relevant Logics. [Citation Graph (0, 0)][DBLP]
   Logic Journal of the IGPL, 2000, v:8, n:6, pp:- [Journal]
   
4. Ryo Kashima
   On semilattice relevant logics. [Citation Graph (0, 0)][DBLP]
   Math. Log. Q., 2003, v:49, n:4, pp:401-414 [Journal]
   
5. Tatsuya Shimura, Ryo Kashima
   Cut-Elimination Theorem for the Logic of Constant Domains. [Citation Graph (0, 0)][DBLP]
   Math. Log. Q., 1994, v:40, n:, pp:153-172 [Journal]
   
6. Takeshi Yamaguchi, Ryo Kashima
   On the Dif%culty of Writing Out Formal Proofs in Arithmetic. [Citation Graph (0, 0)][DBLP]
   Math. Log. Q., 1997, v:43, n:, pp:328-332 [Journal]
   
7. Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi
   Sequent Calculi for Visser's Propositional Logics. [Citation Graph (0, 0)][DBLP]
   Notre Dame Journal of Formal Logic, 2001, v:42, n:1, pp:1-22 [Journal]
   
8. Ryo Kashima
   Cut-free sequent calculi for some tense logics. [Citation Graph (0, 0)][DBLP]
   Studia Logica, 1994, v:53, n:1, pp:119-136 [Journal]
   
9. Ryo Kashima, Norihiro Kamide
   Substructural Implicational Logics Including the Relevant Logic E. [Citation Graph (0, 0)][DBLP]
   Studia Logica, 1999, v:63, n:2, pp:181-212 [Journal]
   
10. Tatsuaki Okamoto, Ryo Kashima
    Resource Bounded Unprovability of Computational Lower Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]