Independence of countable sets of formulas of the propositional logic
Terziler M.; Öner T.;
Independence of countable sets of formulas of the propositional logic
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.
WOS: 000326301500006
- Ege University Turkey
- Yaşar University Turkey
Completeness, completeness, Classical logic, classical logic, independence, consistence, Axiomatizability, Independence, Consistence, axiomatizability
Completeness, completeness, Classical logic, classical logic, independence, consistence, Axiomatizability, Independence, Consistence, axiomatizability
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
citations
Citations provided by BIP!
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
Green