Absolutely independent axiomatizations for countable sets in classical logic (Q1262297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Absolutely independent axiomatizations for countable sets in classical logic |
scientific article; zbMATH DE number 4123697
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Absolutely independent axiomatizations for countable sets in classical logic |
scientific article; zbMATH DE number 4123697 |
Statements
Absolutely independent axiomatizations for countable sets in classical logic (English)
0 references
1989
0 references
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.
0 references
countable consistent set of sentences
0 references
absolutely independent axiomatization
0 references
