Separability of normalizable superintuitionistic propositional logics

DOI10.1007/BF02314635zbMath0973.03030MaRDI QIDQ1290801

V. I. Khomich

Publication date: 4 July 1999

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

separabilitysuperintuitionistic logicsintermediate propositional logicsnormalizable logics

Mathematics Subject Classification ID

Intermediate logics (03B55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of superintuitionistic propositional calculi
• Axiomatization of models for intermediate logics constructed with Boolean models by piling up
• The separable axiomatization of the intermediate propositional systems $S_n $ of Gödel
• On the separation theorem of intermediate propositional calculi
• Algebraic proof of the separation theorem on Dummett's $\mathrm{LC}$
• A criterion for the separable axiomatization of Gödel's $S_n $
• The decidability of certain intermediate propositional logics
• The separation theorem of intuitionist propositional calculus
• A note on the reduction of Gentzen’s calculus 𝐿𝐽
• [Russian Text Ignored.]

This page was built for publication: Separability of normalizable superintuitionistic propositional logics