The propositional formula set F(S) is classified into sixteen classifications by using R0 implication operator, and it is proved that this partition about negation is congruent. Moreover, we discuss whether each classification in F(S) is closed under modus ponens and hypothetical syllogism.