The interest in fragments of predicate logics is motivated by the well-known fact that full classical predicate calculus is undecidable (cf. Church ). So it is desirable to find decidable fragments which are in some sense “maximal”, i.e., which become undecidable if they are “slightly” extended. Or, alternatively, we can look for “minimal” undecidable fragments and try to identify the vague boundary between decidability and undecidability. A great deal of work in this area concerning mainly classical logic has been done since the thirties. We will not give a complete review of decidability and undecidability results in classical logic, referring the reader to existing monographs (cf. Suranyi , Lewis , and Dreben, Goldfarb ). A short summary can also be found in the well-known book Church . Let us recall only several facts. Herein we will consider only logics without functional symbols, constants, and equality.
(C1) The fragment of the classical logic with only monadic predicate letters is decidable (cf. Behmann ).
(C2) The fragment of the classical logic with a single binary predicate letter is undecidable. (This is a consequence of Gödel .)
(C3) The fragment of the classical logic with a single individual variable is decidable; in fact it is equivalent to Lewis S5 (cf. Wajsberg ).
(C4) The fragment of the classical logic with two individual variables is decidable (Segerberg  contains a proof using modal logic; Scott  and Mortimer  give traditional proofs.)
(C5) The fragment of the classical logic with three individual variables and binary predicate letters is undecidable (cf. Surańyi ). In fact this paper considers formulas of the following type
φ,ψ being quantifier-free and the set of binary predicate letters which can appear in φ or ψ being fixed and finite.