Order:
Disambiguations
Tatsuya Shimura [9]T. Shimura [1]Takeshi Shimura [1]
  1.  54
    Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas.Tatsuya Shimura - 1993 - Studia Logica 52 (1):23 - 40.
    For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  2.  34
    Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.
    The logic CD is an intermediate logic which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen-type formulation called LD and rules are replaced by the corresponding intuitionistic rules) and that the cut-elimination theorem does not hold for LD. In this paper we present a modification of LD and prove the cut-elimination theorem for it. Moreover we prove a “weak” version of cut-elimination theorem for LD, saying that all “cuts” except (...)
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  3.  39
    Kripke incompleteness of predicate extensions of the modal logics axiomatized by a canonical formula for a frame with a nontrivial cluster.Tatsuya Shimura - 2000 - Studia Logica 65 (2):237-247.
    We generalize the incompleteness proof of the modal predicate logic Q-S4+ p p + BF described in Hughes-Cresswell [6]. As a corollary, we show that, for every subframe logic Lcontaining S4, Kripke completeness of Q-L+ BF implies the finite embedding property of L.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  19
    On completeness of intermediate predicate logics with respect to {K}ripke semantics.T. Shimura - 1995 - Bulletin of the Section of Logic 24:41-45.
    In spite of the existence of many examples of incomplete logics, it is an important problem to find intermediate predicate logics complete with respect to Kripke frame (or Kripke sheaf) semantics because they are closed under substitution. But, most of known completeness proofs of finitely axiomatizable logics are difficult to apply to other logics since they are highly dependent on the specific properties of given logics. So, it is preferable to find a general methods of completeness proof. We give some (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  26
    Kripke completeness of predicate extensions of cofinal subframe logics.Tatsuya Shimura - 2001 - Bulletin of the Section of Logic 30 (2):107-114.
  6.  26
    Kripke incompleteness of predicate extentions of Gabbay-de jongh's logic of the finite binary trees.Tatsuya Shimura - 2002 - Bulletin of the Section of Logic 31 (2):111-118.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  35
    On the strength of PA with a non-principal ultrafilter quantifier.Tatsuya Shimura - 1991 - Annals of the Japan Association for Philosophy of Science 8 (1):17-21.
  8. Suzuki Daisetsu zuibunki.Takeshi Shimura - 1967 - Edited by Daisetz Teitaro Suzuki.
     
    Export citation  
     
    Bookmark  
  9.  35
    Some superintuitionistic logics as the logical fragments of equational theories.Tatsuya Shimura & Nobu-Yuki Suzuki - 1993 - Bulletin of the Section of Logic 22:106-112.