Switch to: References

Add citations

You must login to add citations.
  1. Intermediate Logics Admitting a Structural Hypersequent Calculus.Frederik M. Lauridsen - 2019 - Studia Logica 107 (2):247-282.
    We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form \, where \ is the hypersequent counterpart of the sequent calculus \ for propositional intuitionistic logic, and \ is a set of so-called structural hypersequent rules, i.e., rules not involving any logical connectives. The characterisation of this class of intermediate logics is presented both in terms of the algebraic and the relational semantics for intermediate logics. We discuss various—positive as well as negative—consequences of this characterisation.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hereditarily Structurally Complete Intermediate Logics: Citkin’s Theorem Via Duality.Nick Bezhanishvili & Tommaso Moraschini - 2023 - Studia Logica 111 (2):147-186.
    A deductive system is said to be structurally complete if its admissible rules are derivable. In addition, it is called hereditarily structurally complete if all its extensions are structurally complete. Citkin (1978) proved that an intermediate logic is hereditarily structurally complete if and only if the variety of Heyting algebras associated with it omits five finite algebras. Despite its importance in the theory of admissible rules, a direct proof of Citkin’s theorem is not widely accessible. In this paper we offer (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Locally Finite Reducts of Heyting Algebras and Canonical Formulas.Guram Bezhanishvili & Nick Bezhanishvili - 2017 - Notre Dame Journal of Formal Logic 58 (1):21-45.
    The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Remarks on Stable Formulas in Intuitionistic Logic.Majid Alizadeh & Ali Bibak - forthcoming - Logic and Logical Philosophy:1.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•