The present paper is a continuation of [6] and [7]. Thus the content of this paper is the following. At first we establish properties of systems S 2 n and S 2∗ n , where systems S 2 n and S 2∗ n are extensions of Rasiowa-S lupecki’s systems Sn and S ∗ n . Then we shall show that for every cardinal number m there exist a system ST 4 m of propositional calculus and a system SP 4 m (...) of predicate calculus such that the system ST 4 m has exactly m Lindenbaum’s oversystems and the system SP 4 m has exactly m Lindenbaum’s oversystems, where 1 ≤ m ≤ 2 ℵ0. (shrink)

Artykuł jest celnym przeglądem metod dowodzenia twierdzeń o stopniach maksymalności i rezultatów uzyskanych w tej dziedzinie do 1979 r.

A term td is called a ternary deductive term for a variety of algebras V if the identity td≈r holds in V and ∈θ yields td≈td for any A∈V and any principal congruence θ on A. A connective f is called td-distributive if td)≈ f,…,td). If L is a propositional logic and V is a corresponding variety that has a TD term td, then any admissible in L rule, the premises of which contain only td-distributive operations, is derivable, and the (...) substitution r↦td is a projective L-unifier for any formula containing only td-distributive connectives. The above substitution is a generalization of the substitution introduced by T. Prucnal to prove structural completeness of the implication fragment of intuitionistic propositional logic. (shrink)

Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic and its consistent axiomatic extensions . A Kripke semantics characterization is given for the structurally complete implication–negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of form a PSPACE-complete set and have no finite basis.