Switch to: References

Add citations

You must login to add citations.
  1. Proof Theory for Admissible Rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
    Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In this paper, a Gentzen-style framework is introduced for analytic proof systems that derive admissible rules of non-classical logics. While Gentzen systems for derivability treat sequents as basic objects, for admissibility, the basic objects are sequent rules. Proof systems are defined here for admissible rules of classes of modal logics, including K4, S4, and GL, and also Intuitionistic Logic IPC. With minor (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • A Many-Sorted Variant of Japaridze’s Polymodal Provability Logic.Gerald Berger, Lev D. Beklemishev & Hans Tompits - 2018 - Logic Journal of the IGPL 26 (5):505-538.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Closed Fragments of Provability Logics of Constructive Theories.Albert Visser - 2008 - Journal of Symbolic Logic 73 (3):1081-1096.
    In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the closed fragment of the provability logic of Heyting's Arithmetic plus Markov's Principle and Heyting's Arithmetic plus Primitive Recursive Markov's Principle.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Intermediate Logics and the de Jongh Property.Dick De Jongh, Rineke Verbrugge & Albert Visser - 2011 - Archive for Mathematical Logic 50 (1-2):197-213.
    We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Predicate Logics of Constructive Arithmetical Theories.Albert Visser - 2006 - Journal of Symbolic Logic 71 (4):1311 - 1326.
    In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - Journal of Symbolic Logic 72 (2):439 - 451.
    The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations