Independence of countable sets of formulas of the propositional logic
Loading...
Date
2013
Authors
Tahsi̊n Öner
Mehmet Terziler
Journal Title
Journal ISSN
Volume Title
Publisher
Charles Babbage Research Centre
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. © 2023 Elsevier B.V. All rights reserved.
Description
Keywords
Axiomatizability, Classical Logic, Completeness, Consistence, Independence
Fields of Science
Citation
WoS Q
Scopus Q
Source
Volume
Issue
Start Page
End Page
Collections
