The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kentaro Kikuchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kentaro Kikuchi
    A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:244-259 [Conf]
  2. Kentaro Kikuchi
    On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:120-134 [Conf]
  3. Kentaro Kikuchi, Katsumi Sasaki
    A Cut-Free Gentzen Formulation of Basic Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2003, v:12, n:2, pp:213-225 [Journal]
  4. Kentaro Kikuchi
    Dual-Context Sequent Calculus and Strict Implication. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:1, pp:87-92 [Journal]
  5. Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi
    Sequent Calculi for Visser's Propositional Logics. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 2001, v:42, n:1, pp:1-22 [Journal]
  6. Kentaro Kikuchi
    Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:398-407 [Conf]
  7. Kentaro Kikuchi
    Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:257-272 [Conf]
  8. Ryo Ishigaki, Kentaro Kikuchi
    Tree-Sequent Methods for Subintuitionistic Predicate Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2007, pp:149-164 [Conf]
  9. Ryo Ishigaki, Kentaro Kikuchi
    A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2007, v:15, n:2, pp:149-164 [Journal]

  10. Chained Declustering using Multiple Conventional Filesystems. [Citation Graph (, )][DBLP]


  11. Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. [Citation Graph (, )][DBLP]


  12. Call-by-name reduction and cut-elimination in classical logic. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002