Switch to: References

Add citations

You must login to add citations.
  1. On finite linear intermediate predicate logics.Hiroakira Ono - 1988 - Studia Logica 47 (4):391 - 399.
    An intermediate predicate logicS + n (n>0) is introduced and investigated. First, a sequent calculusGS n is introduced, which is shown to be equivalent toS + n and for which the cut elimination theorem holds. In § 2, it will be shown thatS + n is characterized by the class of all linear Kripke frames of the heightn.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Kripke Sheaf Completeness of some Superintuitionistic Predicate Logics with a Weakened Constant Domains Principle.Dmitrij Skvortsov - 2012 - Studia Logica 100 (1-2):361-383.
    The completeness w.r.t. Kripke frames with equality (or, equivalently, w.r.t. Kripke sheaves, [ 8 ] or [4, Sect. 3.6]) is established for three superintuitionistic predicate logics: ( Q - H + D *), ( Q - H + D *&K), ( Q - H + D *& K & J ). Here Q - H is intuitionistic predicate logic, J is the principle of the weak excluded middle, K is Kuroda’s axiom, and D * (cf. [ 12 ]) is a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the predicate logics of finite Kripke frames.D. Skvortsov - 1995 - Studia Logica 54 (1):79-88.
    In [Ono 1987] H. Ono put the question about axiomatizing the intermediate predicate logicLFin characterized by the class of all finite Kripke frames. It was established in [ Skvortsov 1988] thatLFin is not recursively axiomatizable. One can easily show that for any finite posetM, the predicate logic characterized byM is recursively axiomatizable, and its axiomatization can be constructed effectively fromM. Namely, the set of formulas belonging to this logic is recursively enumerable, since it is embeddable in the two-sorted classical predicate (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations