Functional completeness for subsystems of intuitionistic propositional logic

From MaRDI portal





In this paper a proof-theoretic proof of functional completeness is presented for a broad variety of substructural subsystems of intuitionistic and minimal propositional logic. The space of admissible connectives is described by rule schemata in a higher-level sequent calculus framework.











This page was built for publication: Functional completeness for subsystems of intuitionistic propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802397)