- Cofinal stable logics
- Studia Logica
- Volume | Issue number
- 104 | 6
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
Faculty of Science (FNWI)
- Institute for Logic, Language and Computation (ILLC)
We generalize the (∧,∨)-canonical formulas to (∧,∨)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by (∧,∨)-canonical rules. This yields a convenient characterization of stable superintuitionistic logics. The (∧,∨)-canonical formulas are analogues of the (∧,→)-canonical formulas, which are the algebraic counterpart of Zakharyaschev’s canonical formulas for superintuitionistic logics (si-logics for short). Consequently, stable si-logics are analogues of subframe si-logics. We introduce cofinal stable intuitionistic multi-conclusion consequence relations and cofinal stable si-logics, thus answering the question of what the analogues of cofinal subframe logics should be. This is done by utilizing the (∧,∨,¬)-reduct of Heyting algebras. We prove that every cofinal stable si-logic has the finite model property, and that there are continuum many cofinal stable si-logics that are not stable. We conclude with several examples showing the similarities and differences between the classes of stable, cofinal stable, subframe, and cofinal subframe si-logics.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.