Tahsin OnerMehmet TerzilerOner, TahsinTerziler, Mehmet2025-10-0620130381-70322-s2.0-84901777851https://gcris.yasar.edu.tr/handle/123456789/7322In 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.Englishinfo:eu-repo/semantics/closedAccessclassical logic, independence, consistence, axiomatizability, completenessConsistenceCompletenessIndependenceAxiomatizabilityClassical LogicArticle