Applications of weak Kripke semantics to intermediate consequences

abstract

Section 1 contains a Kripke-style completeness theorem for arbitrary intermediate consequences. In Section 2 we apply weak Kripke semantics to splittings in order to obtain generalized axiomatization criteria of the Jankov-type. Section 3 presents new and short proofs of recent results on implicationless intermediate consequences. In Section 4 we prove that these consequences admit no deduction theorem. In Section 5 all maximal logics in the 3^rd counterslice are determined. On these results we reported at the 1980 meeting on Mathematical Logic at Oberwolfach. This paper concerns propositional logic only.