default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyo Kashima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j14]Kento Takagi, Ryo Kashima
:
On the completeness and the decidability of strictly monadic second-order logic. Math. Log. Q. 66(4): 438-447 (2020)- 2015
- [j13]Ken-etsu Fujita, Ryo Kashima, Yuichi Komori, Naosuke Matsuda:
Reduction Rules for Intuitionistic λρ-calculus. Stud Logica 103(6): 1225-1244 (2015) - 2014
- [j12]Ryo Kashima:
An axiomatization of ECTL. J. Log. Comput. 24(1): 117-133 (2014) - 2008
- [j11]Ryo Ishigaki, Ryo Kashima:
Sequent Calculi for Some Strict Implication Logics. Log. J. IGPL 16(2): 155-174 (2008) - [j10]Ryo Kashima, Keishi Okamoto:
General Models and Completeness of First-Order Modal µ-calculus. J. Log. Comput. 18(4): 497-507 (2008) - 2003
- [j9]Ichiro Hasuo, Ryo Kashima:
Kripke Completeness of First-Order Constructive Logics with Strong Negation. Log. J. IGPL 11(6): 615-646 (2003) - [j8]Ryo Kashima:
On semilattice relevant logics. Math. Log. Q. 49(4): 401-414 (2003) - 2001
- [j7]Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi:
Sequent Calculi for Visser's Propositional Logics. Notre Dame J. Formal Log. 42(1): 1-22 (2001) - 2000
- [j6]Ryo Kashima:
Completeness of Implicational Relevant Logics. Log. J. IGPL 8(6): 761-785 (2000) - 1999
- [j5]Ryo Kashima, Norihiro Kamide:
Substructural Implicational Logics Including the Relevant Logic E. Stud Logica 63(2): 181-212 (1999) - 1997
- [j4]Ryo Kashima:
Contraction-Elimination for Implicational Logics. Ann. Pure Appl. Log. 84(1): 17-39 (1997) - [j3]Takeshi Yamaguchi, Ryo Kashima:
On the Difficulty of Writing Out Formal Proofs in Arithmetic. Math. Log. Q. 43: 328-332 (1997) - 1994
- [j2]Tatsuya Shimura, Ryo Kashima:
Cut-Elimination Theorem for the Logic of Constant Domains. Math. Log. Q. 40: 153-172 (1994) - [j1]Ryo Kashima:
Cut-free sequent calculi for some tense logics. Stud Logica 53(1): 119-136 (1994)
Conference and Workshop Papers
- 2010
- [c1]Ryo Kashima:
Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility Relation. Advances in Modal Logic 2010: 200-217
Informal and Other Publications
- 2005
- [i2]Tatsuaki Okamoto, Ryo Kashima:
Resource Bounded Unprovability of Computational Lower Bounds. CoRR abs/cs/0503091 (2005) - 2003
- [i1]Tatsuaki Okamoto, Ryo Kashima:
Resource Bounded Unprovability of Computational Lower Bounds. IACR Cryptol. ePrint Arch. 2003: 187 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
