×

zbMATH — the first resource for mathematics

Kashima, Ryo

Compute Distance To:
Author ID: kashima.ryo Recent zbMATH articles by "Kashima, Ryo"
Published as: Kashima, Ryo
Documents Indexed: 19 Publications since 1992

Publications by Year

Citations contained in zbMATH Open

10 Publications have been cited 44 times in 40 Documents Cited by Year
Cut-free sequent calculi for some tense logics. Zbl 0813.03012
Kashima, Ryo
25
1994
Kripke completeness of first-order constructive logics with strong negation. Zbl 1048.03022
Hasuo, Ichiro; Kashima, Ryo
7
2003
Sequent calculi for some strict implication logics. Zbl 1138.03009
Ishigaki, Ryo; Kashima, Ryo
2
2008
A proof of the standardization theorem in \(\lambda\)-calculus. Zbl 1047.03502
Kashima, Ryo
2
2001
Substructural implicational logics including the relevant logic E. Zbl 0943.03019
Kashima, Ryo; Kamide, Norihiro
2
1999
Contraction-elimination for implicational logics. Zbl 0872.03037
Kashima, Ryo
2
1997
On semilattice relevant logics. Zbl 1027.03017
Kashima, Ryo
1
2003
Sequent calculi for Visser’s propositional logics. Zbl 1023.03054
Ishii, Katsumasa; Kashima, Ryo; Kikuchi, Kentaro
1
2001
Cut-elimination theorem for the logic of constant domains. Zbl 0822.03016
Kashima, Ryo; Shimura, Tatsuya
1
1994
The word problem for free BCI-algebras is decidable. Zbl 0787.06018
Kashima, Ryo; Komori, Yuichi
1
1992
Sequent calculi for some strict implication logics. Zbl 1138.03009
Ishigaki, Ryo; Kashima, Ryo
2
2008
Kripke completeness of first-order constructive logics with strong negation. Zbl 1048.03022
Hasuo, Ichiro; Kashima, Ryo
7
2003
On semilattice relevant logics. Zbl 1027.03017
Kashima, Ryo
1
2003
A proof of the standardization theorem in \(\lambda\)-calculus. Zbl 1047.03502
Kashima, Ryo
2
2001
Sequent calculi for Visser’s propositional logics. Zbl 1023.03054
Ishii, Katsumasa; Kashima, Ryo; Kikuchi, Kentaro
1
2001
Substructural implicational logics including the relevant logic E. Zbl 0943.03019
Kashima, Ryo; Kamide, Norihiro
2
1999
Contraction-elimination for implicational logics. Zbl 0872.03037
Kashima, Ryo
2
1997
Cut-free sequent calculi for some tense logics. Zbl 0813.03012
Kashima, Ryo
25
1994
Cut-elimination theorem for the logic of constant domains. Zbl 0822.03016
Kashima, Ryo; Shimura, Tatsuya
1
1994
The word problem for free BCI-algebras is decidable. Zbl 0787.06018
Kashima, Ryo; Komori, Yuichi
1
1992

Citations by Year