Ryo Kashima

According to our database, Ryo Kashima authored at least 16 papers between 1994 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

On the completeness and the decidability of strictly monadic second-order logic.

Kento Takagi, Ryo Kashima

Math. Log. Q., 2020

2015

Reduction Rules for Intuitionistic λρ-calculus.

Ken-etsu Fujita, Ryo Kashima, Yuichi Komori, Naosuke Matsuda

Stud Logica, 2015

2014

An axiomatization of ECTL.

Ryo Kashima

J. Log. Comput., 2014

2010

Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility Relation.

Ryo Kashima

Proceedings of the Advances in Modal Logic 8, 2010

2008

General Models and Completeness of First-Order Modal µ-calculus.

Ryo Kashima, Keishi Okamoto

J. Log. Comput., 2008

Sequent Calculi for Some Strict Implication Logics.

Ryo Ishigaki, Ryo Kashima

Log. J. IGPL, 2008

2003

On semilattice relevant logics.

Ryo Kashima

Math. Log. Q., 2003

Kripke Completeness of First-Order Constructive Logics with Strong Negation.

Ichiro Hasuo, Ryo Kashima

Log. J. IGPL, 2003

Resource Bounded Unprovability of Computational Lower Bounds.

Tatsuaki Okamoto, Ryo Kashima

IACR Cryptol. ePrint Arch., 2003

2001

Sequent Calculi for Visser's Propositional Logics.

Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi

Notre Dame J. Formal Log., 2001

2000

Completeness of Implicational Relevant Logics.

Ryo Kashima

Log. J. IGPL, 2000

1999

Substructural Implicational Logics Including the Relevant Logic E.

Ryo Kashima, Norihiro Kamide

Stud Logica, 1999

1997

On the Difficulty of Writing Out Formal Proofs in Arithmetic.

Takeshi Yamaguchi, Ryo Kashima

Math. Log. Q., 1997

Contraction-Elimination for Implicational Logics.

Ryo Kashima

Ann. Pure Appl. Log., 1997

1994

Cut-free sequent calculi for some tense logics.

Ryo Kashima

Stud Logica, 1994

Cut-Elimination Theorem for the Logic of Constant Domains.

Tatsuya Shimura, Ryo Kashima

Math. Log. Q., 1994