
Search the dblp DataBase
Ryo Kashima:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Ryo Kashima
ContractionElimination for Implicational Logics. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:1739 [Journal]
 Ichiro Hasuo, Ryo Kashima
Kripke Completeness of FirstOrder Constructive Logics with Strong Negation. [Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2003, v:11, n:6, pp:615646 [Journal]
 Ryo Kashima
Completeness of Implicational Relevant Logics. [Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2000, v:8, n:6, pp: [Journal]
 Ryo Kashima
On semilattice relevant logics. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2003, v:49, n:4, pp:401414 [Journal]
 Tatsuya Shimura, Ryo Kashima
CutElimination Theorem for the Logic of Constant Domains. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 1994, v:40, n:, pp:153172 [Journal]
 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:328332 [Journal]
 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:122 [Journal]
 Ryo Kashima
Cutfree sequent calculi for some tense logics. [Citation Graph (0, 0)][DBLP] Studia Logica, 1994, v:53, n:1, pp:119136 [Journal]
 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:181212 [Journal]
 Tatsuaki Okamoto, Ryo Kashima
Resource Bounded Unprovability of Computational Lower Bounds [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp: [Journal]
Search in 0.002secs, Finished in 0.002secs
