Ryo Kashima - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2020

On the completeness and the decidability of strictly monadic second-order logicKento Takagi, Ryo Kashima. mlq, 66(4):438-447, 2020. [doi]

2015

Reduction Rules for Intuitionistic λρ-calculusKen-etsu Fujita, Ryo Kashima, Yuichi Komori, Naosuke Matsuda. sLogica, 103(6):1225-1244, 2015. [doi]

2014

An axiomatization of ECTLRyo Kashima. logcom, 24(1):117-133, 2014. [doi]

2010

Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility RelationRyo Kashima. aiml 2010: 200-217 [doi]

2008

Sequent Calculi for Some Strict Implication LogicsRyo Ishigaki, Ryo Kashima. igpl, 16(2):155-174, 2008. [doi]

General Models and Completeness of First-Order Modal µ-calculusRyo Kashima, Keishi Okamoto. logcom, 18(4):497-507, 2008. [doi]

2003

Kripke Completeness of First-Order Constructive Logics with Strong NegationIchiro Hasuo, Ryo Kashima. igpl, 11(6):615-646, 2003. [doi]

On semilattice relevant logicsRyo Kashima. mlq, 49(4):401-414, 2003. [doi]

Resource Bounded Unprovability of Computational Lower BoundsTatsuaki Okamoto, Ryo Kashima. iacr, 2003:187, 2003. [doi]

2001

Sequent Calculi for Visser s Propositional LogicsKatsumasa Ishii, Ryo Kashima, Kentaro Kikuchi. ndjfl, 42(1):1-22, 2001.

2000

Completeness of Implicational Relevant LogicsRyo Kashima. igpl, 8(6):761-785, 2000. [doi]

1999

Substructural Implicational Logics Including the Relevant Logic ERyo Kashima, Norihiro Kamide. sLogica, 63(2):181-212, 1999.

1997

Contraction-Elimination for Implicational LogicsRyo Kashima. APAL, 84(1):17-39, 1997.

On the Dif culty of Writing Out Formal Proofs in ArithmeticTakeshi Yamaguchi, Ryo Kashima. mlq, 43:328-332, 1997.

1994

Cut-free sequent calculi for some tense logicsRyo Kashima. sLogica, 53(1):119-136, 1994.

Cut-Elimination Theorem for the Logic of Constant DomainsTatsuya Shimura, Ryo Kashima. mlq, 40:153-172, 1994.

Sign in or sign up to see more results.

runs on WebDSL