Absolutely independent axiomatizations for countable sets in classical logic
From MaRDI portal
Publication:1262297
In (classical) propositional logic, a set A of sentences is called absolutely independent if for any ordered partition \(<A_ 1,A_ 2>\) of A, the set \(A_ 1\cup \{\neg p|\) \(p\in A_ 2\}\) is consistent. It is shown that a countable consistent set of sentences has always an absolutely independent axiomatization.
Recommendations
Cites work
Cited in
(11)- Independent axiomatizability of sets of sentences
- Explicating logical independence
- Independence of countable sets of formulas of the propositional logic.
- Some proofs of independence in axiomatic set theory
- scientific article; zbMATH DE number 622495 (Why is no real title available?)
- scientific article; zbMATH DE number 682472 (Why is no real title available?)
- Theories of truth for countable languages which conform to classical logic
- Deduktiv abgeschlossene Mengen ohne Basis
- A system of completely independent axioms for the sequence of natural numbers
- On consistent subsets of large sets of satisfiable sentences
- Independence-friendly logic and axiomatic set theory
This page was built for publication: Absolutely independent axiomatizations for countable sets in classical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262297)