Intermediate logics admitting a structural hypersequent calculus
From MaRDI portal
Publication:2422309
DOI10.1007/s11225-018-9791-yzbMath1494.03069OpenAlexW2794671371MaRDI QIDQ2422309
Frederik Möllerström Lauridsen
Publication date: 19 June 2019
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-018-9791-y
Heyting algebras (lattice-theoretic aspects) (06D20) Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03) Intermediate logics (03B55)
Related Items
Jankov Formulas and Axiomatization Techniques for Intermediate Logics, MacNeille transferability and stable classes of Heyting algebras, Hyper-MacNeille completions of Heyting algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypersequent rules with restricted contexts for propositional modal logics
- Automated reasoning with analytic tableaux and related methods. 22nd international conference, TABLEAUX 2013, Nancy, France, September 16--19, 2013. Proceedings
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Locally finite reducts of Heyting algebras and canonical formulas
- Cofinal stable logics
- MacNeille completions of FL-algebras
- Proof analysis in intermediate logics
- Algebraic proof theory: hypersequents and hypercompletions
- Priestley style duality for distributive meet-semilattices
- Residuated lattices. An algebraic glimpse at substructural logics
- Syntax and semantics of superintuitionistic logics
- Gentzen-type formulation of the propositional logic LQ
- Contraction-free sequent calculi for geometric theories with an application to Barr's theorem
- Uniform interpolation and sequent calculi in modal logic
- Stable formulas in intuitionistic logic
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
- Canonical formulas for \(k\)-potent commutative, integral, residuated lattices
- Projective distributive lattices
- On some calculi of modal logic
- The category of semilattices
- Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
- STABLE CANONICAL RULES
- Hypersequent and Labelled Calculi for Intermediate Logics
- Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
- One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property
- Canonical rules
- A constructive analysis of RM
- A Cut‐Free Calculus For Dummett's LC Quantified
- Unified correspondence as a proof-theoretic tool
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- Canonical formulas for K4. Part II: Cofinal subframe logics
- STABLE MODAL LOGICS
- From Frame Properties to Hypersequent Rules in Modal Logics
- Power and Limits of Structural Display Rules
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- MacNeille completions and canonical extensions
- Bounded lattice expansions
