Intermediate logics admitting a structural hypersequent calculus
From MaRDI portal
Publication:2422309
Recommendations
Cites work
- scientific article; zbMATH DE number 1612549 (Why is no real title available?)
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 956466 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3482306 (Why is no real title available?)
- scientific article; zbMATH DE number 3501559 (Why is no real title available?)
- scientific article; zbMATH DE number 6863852 (Why is no real title available?)
- A Cut‐Free Calculus For Dummett's LC Quantified
- A constructive analysis of RM
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Algebraic proof theory: hypersequents and hypercompletions
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Automated reasoning with analytic tableaux and related methods. 22nd international conference, TABLEAUX 2013, Nancy, France, September 16--19, 2013. Proceedings
- Bounded lattice expansions
- Canonical formulas for K4. Part II: Cofinal subframe logics
- Canonical formulas for \(k\)-potent commutative, integral, residuated lattices
- Canonical rules
- Cofinal stable logics
- Contraction-free sequent calculi for geometric theories with an application to Barr's theorem
- Correspondence between modal Hilbert axioms and sequent rules with an application to S5
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- From Frame Properties to Hypersequent Rules in Modal Logics
- Gentzen-type formulation of the propositional logic LQ
- Hypersequent and labelled calculi for intermediate logics
- Hypersequent calculi for some intermediate logics with bounded Kripke models
- Hypersequent rules with restricted contexts for propositional modal logics
- Locally finite reducts of Heyting algebras and canonical formulas
- MacNeille completions and canonical extensions
- MacNeille completions of FL-algebras
- On some calculi of modal logic
- One-step Heyting algebras and hypersequent calculi with the bounded proof property
- Power and limits of structural display rules
- Priestley style duality for distributive meet-semilattices
- Projective distributive lattices
- Proof analysis in intermediate logics
- Residuated lattices. An algebraic glimpse at substructural logics
- Stable canonical rules
- Stable formulas in intuitionistic logic
- Stable modal logics
- Syntax and semantics of superintuitionistic logics
- The category of semilattices
- Unified correspondence as a proof-theoretic tool
- Uniform interpolation and sequent calculi in modal logic
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
Cited in
(10)- scientific article; zbMATH DE number 1612549 (Why is no real title available?)
- Hypersequent calculi for some intermediate logics with bounded Kripke models
- On the concurrent computational content of intermediate logics
- MacNeille transferability and stable classes of Heyting algebras
- Bunched hypersequent calculi for distributive substructural logics
- Jankov Formulas and Axiomatization Techniques for Intermediate Logics
- Reflexive intermediate first-order logics
- Intermediate logics in the setting of team semantics
- Hyper-MacNeille completions of Heyting algebras
- Hypersequent and labelled calculi for intermediate logics
This page was built for publication: Intermediate logics admitting a structural hypersequent calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422309)
