An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi

DOI10.1002/MALQ.19690151603zbMath0216.28802OpenAlexW2064801445MaRDI QIDQ5619814

J. G. Anderson

Publication date: 1969

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19690151603

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV

This page was built for publication: An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi