Independence of countable sets of formulas of the propositional logic.
From MaRDI portal
Publication:2936652
Recommendations
Cited in
(13)- Existence of the least and the greatest elements of a subset of the Lindenbaum algebra
- Independence Results in Algebraic Logic
- An independent set of axioms of MV-algebras and solutions of the set-theoretical Yang-Baxter equation
- scientific article; zbMATH DE number 682472 (Why is no real title available?)
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- Independent axiomatizability of sets of sentences
- scientific article; zbMATH DE number 3865246 (Why is no real title available?)
- scientific article; zbMATH DE number 3928984 (Why is no real title available?)
- Properties of the logical consequence operation and its relationship with the independence of propositional logic
- Absolutely independent axiomatizations for countable sets in classical logic
- Independence of the primitive symbols of Lewis's calculi of propositions
- Deduktiv abgeschlossene Mengen ohne Basis
- Independence-friendly logic and axiomatic set theory
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)
