Ryo Kashima

Orcid: 0000-0001-7399-3152

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
On the completeness and the decidability of strictly monadic second-order logic.
Math. Log. Q., 2020

2015
Reduction Rules for Intuitionistic λρ-calculus.
Stud Logica, 2015

2014
An axiomatization of ECTL.
J. Log. Comput., 2014

2010
Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility Relation.
Proceedings of the Advances in Modal Logic 8, 2010

2008
General Models and Completeness of First-Order Modal µ-calculus.
J. Log. Comput., 2008

Sequent Calculi for Some Strict Implication Logics.
Log. J. IGPL, 2008

2003
On semilattice relevant logics.
Math. Log. Q., 2003

Kripke Completeness of First-Order Constructive Logics with Strong Negation.
Log. J. IGPL, 2003

Resource Bounded Unprovability of Computational Lower Bounds.
IACR Cryptol. ePrint Arch., 2003

2001
Sequent Calculi for Visser's Propositional Logics.
Notre Dame J. Formal Log., 2001

2000
Completeness of Implicational Relevant Logics.
Log. J. IGPL, 2000

1999
Substructural Implicational Logics Including the Relevant Logic E.
Stud Logica, 1999

1997
On the Difficulty of Writing Out Formal Proofs in Arithmetic.
Math. Log. Q., 1997

Contraction-Elimination for Implicational Logics.
Ann. Pure Appl. Log., 1997

1994
Cut-free sequent calculi for some tense logics.
Stud Logica, 1994

Cut-Elimination Theorem for the Logic of Constant Domains.
Math. Log. Q., 1994


  Loading...