INDEPENDENCE OF COUNTABLE SETS OF FORMULAS OF THE PROPOSITIONAL LOGIC
Loading...
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
CHARLES BABBAGE RES CTR
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
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.
Description
Keywords
classical logic, independence, consistence, axiomatizability, completeness, Consistence, Completeness, Independence, Axiomatizability, Classical Logic
Fields of Science
Citation
WoS Q
Scopus Q
Source
Ars Combinatoria
Volume
112
Issue
Start Page
73
End Page
80
