Independence of Countable Sets of Formulas of The Propositional Logic

Abstract

In this paper, we prove that every countable set of formulas of the propositional logic has at least one equivalent independent subset. We illustrate the situation by considering axioms for Boolean algebras; the proof of independence we give uses model forming.