Separability of normalizable superintuitionistic propositional logics
From MaRDI portal
Publication:1290801
Recommendations
Cites work
- scientific article; zbMATH DE number 3122413 (Why is no real title available?)
- scientific article; zbMATH DE number 3726314 (Why is no real title available?)
- scientific article; zbMATH DE number 3497865 (Why is no real title available?)
- scientific article; zbMATH DE number 3236052 (Why is no real title available?)
- scientific article; zbMATH DE number 3261581 (Why is no real title available?)
- scientific article; zbMATH DE number 3280029 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A criterion for the separable axiomatization of Gödel's $S_n $
- A note on the reduction of Gentzen’s calculus 𝐿𝐽
- Algebraic proof of the separation theorem on Dummett's $\mathrm{LC}$
- Axiomatization of models for intermediate logics constructed with Boolean models by piling up
- On the separation theorem of intermediate propositional calculi
- Properties of superintuitionistic propositional calculi
- The decidability of certain intermediate propositional logics
- The separable axiomatization of the intermediate propositional systems $S_n $ of Gödel
- The separation theorem of intuitionist propositional calculus
- [Russian Text Ignored.]
Cited in
(3)
This page was built for publication: Separability of normalizable superintuitionistic propositional logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290801)