Switch to: References

Citations of:

Basic logic, k4, and persistence

Studia Logica 63 (3):343-352 (1999)

Add citations

You must login to add citations.
  1. A cut-free Gentzen formulation of basic propositional calculus.Kentaro Kikuchi & Katsumi Sasaki - 2003 - Journal of Logic, Language and Information 12 (2):213-225.
    We introduce a Gentzen style formulation of Basic Propositional Calculus(BPC), the logic that is interpreted in Kripke models similarly tointuitionistic logic except that the accessibility relation of eachmodel is not necessarily reflexive. The formulation is presented as adual-context style system, in which the left hand side of a sequent isdivided into two parts. Giving an interpretation of the sequents inKripke models, we show the soundness and completeness of the system withrespect to the class of Kripke models. The cut-elimination theorem isproved (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Closer Look at Some Subintuitionistic Logics.Ramon Jansana & Sergio Celani - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
    In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logics so obtained are called subintuitionistic logics in the literature. We depart from the perspective of considering a logic just as a (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
    It is shown that all the provably total functions of Basic Arithmetic BA, a theory introduced by Ruitenburg based on Predicate Basic Calculus, are primitive recursive. Along the proof a new kind of primitive recursive realizability to which BA is sound, is introduced. This realizability is similar to Kleene's recursive realizability, except that recursive functions are restricted to primitive recursives.
    Download  
     
    Export citation  
     
    Bookmark   4 citations