×
Compute Distance To:
Author ID: kashima.ryo Recent zbMATH articles by "Kashima, Ryo"
Published as: Kashima, Ryo

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 54 times in 50 Documents Cited by Year
Cut-free sequent calculi for some tense logics. Zbl 0813.03012
Kashima, Ryo
29
1994
Kripke completeness of first-order constructive logics with strong negation. Zbl 1048.03022
Hasuo, Ichiro; Kashima, Ryo
7
2003
Cut-elimination theorem for the logic of constant domains. Zbl 0822.03016
Kashima, Ryo; Shimura, Tatsuya
4
1994
On semilattice relevant logics. Zbl 1027.03017
Kashima, Ryo
3
2003
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
Sequent calculi for some strict implication logics. Zbl 1138.03009
Ishigaki, Ryo; Kashima, Ryo
2
2008
General models and completeness of first-order modal \(\mu \)-calculus. Zbl 1150.03008
Kashima, Ryo; Okamoto, Keishi
1
2008
Completeness of implicational relevant logics. Zbl 0970.03026
Kashima, Ryo
1
2000
Sequent calculi for Visser’s propositional logics. Zbl 1023.03054
Ishii, Katsumasa; Kashima, Ryo; Kikuchi, Kentaro
1
2001
The word problem for free BCI-algebras is decidable. Zbl 0787.06018
Kashima, Ryo; Komori, Yuichi
1
1992
A proof of the standardization theorem in \(\lambda\)-calculus. Zbl 1047.03502
Kashima, Ryo
1
2001
Sequent calculi for some strict implication logics. Zbl 1138.03009
Ishigaki, Ryo; Kashima, Ryo
2
2008
General models and completeness of first-order modal \(\mu \)-calculus. Zbl 1150.03008
Kashima, Ryo; Okamoto, Keishi
1
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
3
2003
Sequent calculi for Visser’s propositional logics. Zbl 1023.03054
Ishii, Katsumasa; Kashima, Ryo; Kikuchi, Kentaro
1
2001
A proof of the standardization theorem in \(\lambda\)-calculus. Zbl 1047.03502
Kashima, Ryo
1
2001
Completeness of implicational relevant logics. Zbl 0970.03026
Kashima, Ryo
1
2000
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
29
1994
Cut-elimination theorem for the logic of constant domains. Zbl 0822.03016
Kashima, Ryo; Shimura, Tatsuya
4
1994
The word problem for free BCI-algebras is decidable. Zbl 0787.06018
Kashima, Ryo; Komori, Yuichi
1
1992

Citations by Year