Independence of countable sets of formulas of the propositional logic
| dc.contributor.author | Tahsi̊n Öner | |
| dc.contributor.author | Mehmet Terziler | |
| dc.date.accessioned | 2025-10-06T17:52:48Z | |
| dc.date.issued | 2013 | |
| dc.description.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. | |
| dc.identifier.issn | 28175204, 03817032 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901777851&partnerID=40&md5=1806d63a764c257f6c7dae8be53977df | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/10127 | |
| dc.language.iso | English | |
| dc.publisher | Charles Babbage Research Centre | |
| dc.source | Ars Combinatoria | |
| dc.subject | Axiomatizability, Classical Logic, Completeness, Consistence, Independence | |
| dc.title | Independence of countable sets of formulas of the propositional logic | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| gdc.coar.type | text::journal::journal article | |
| gdc.index.type | Scopus | |
| oaire.citation.endPage | 80 | |
| oaire.citation.startPage | 73 | |
| person.identifier.scopus-author-id | Öner- Tahsi̊n (6505910883), Terziler- Mehmet (6508113347) | |
| publicationvolume.volumeNumber | 112 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |