scientific article; zbMATH DE number 3875241

From MaRDI portal
Publication:3342540





By F we denote a set of propositional formulas built from an infinite set \(V=\{p_ 0,p_ 1,p_ 2,...\}\) of propositional variables and the connectives: \(\to\), \(\wedge\). Let ICK be the set of all theses of the positive propositional logic in which the disjunction sign does not occur. Then by CK-intermediate logic (alias CK-logic) we mean any set \(H\subsetneqq F\) containing the set ICK and closed under modus ponens and the substitution rule. For every CK-logic H we define the consequence operation \(C_ H\) in F as follows: \(C_ H(X)\) is the smallest set containing the set \(H\cup X\) and closed with respect to the modus ponens rule. Theorem. For every CK-logic H the following conditions are equivalent: (c1) \(C_ H\) is structurally complete in the infinitary sense, (c2) H is tabular. A perfectly analogous theorem also holds for the pure implicative fragments of intermediate logics.











This page was built for publication:

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