Independence of countable sets of formulas of the propositional logic.

zbMATH Open1313.03001MaRDI QIDQ2936652FDOQ2936652

Authors: Tahsin Öner, M. Terziler 

Publication date: 6 January 2015

Recommendations

• Absolutely independent axiomatizations for countable sets in classical logic
• scientific article; zbMATH DE number 622495
• scientific article; zbMATH DE number 682472
• scientific article
• Deduktiv abgeschlossene Mengen ohne Basis

zbMATH Keywords

independencecompletenessclassical logicaxiomatizabilityconsistence

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cited In (13)

• Title not available (Why is that?)
• Independent axiomatizability of sets of sentences
• Title not available (Why is that?)
• Independence-friendly logic and axiomatic set theory
• Independence Results in Algebraic Logic
• Absolutely independent axiomatizations for countable sets in classical logic
• Properties of the logical consequence operation and its relationship with the independence of propositional logic
• An independent set of axioms of MV-algebras and solutions of the set-theoretical Yang-Baxter equation
• Deduktiv abgeschlossene Mengen ohne Basis
• Independence of the primitive symbols of Lewis's calculi of propositions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Existence of the least and the greatest elements of a subset of the Lindenbaum algebra

This page was built for publication: Independence of countable sets of formulas of the propositional logic.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936652)