Separability of normalizable superintuitionistic propositional logics
From MaRDI portal
Publication:1290801
DOI10.1007/BF02314635zbMATH Open0973.03030MaRDI QIDQ1290801FDOQ1290801
Publication date: 4 July 1999
Published in: Mathematical Notes (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The separation theorem of intuitionist propositional calculus
- The decidability of certain intermediate propositional logics
- Properties of superintuitionistic propositional calculi
- Title not available (Why is that?)
- On the separation theorem of intermediate propositional calculi
- [Russian Text Ignored.]
- Axiomatization of models for intermediate logics constructed with Boolean models by piling up
- Title not available (Why is that?)
- Title not available (Why is that?)
- The separable axiomatization of the intermediate propositional systems $S_n $ of Gödel
- Algebraic proof of the separation theorem on Dummett's $\mathrm{LC}$
- A criterion for the separable axiomatization of Gödel's $S_n $
- Title not available (Why is that?)
- A note on the reduction of Gentzen’s calculus 𝐿𝐽
Cited In (1)
Recommendations
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)