Absolutely independent axiomatizations for countable sets in classical logic
type: Item
instance of: scholarly article
title: Absolutely independent axiomatizations for countable sets in classical logic
zbMATH Open document ID: 0686.03005
DOI: 10.1007/BF00370635
author: Joanna Grygiel
published in: Studia Logica
publication date: 1989-01-01T00:00:00Z
review text: 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.
reviewed by: Aldo Ursini
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 03G99
zbMATH DE Number: 4123697
zbMATH Keywords: countable consistent set of sentences
zbMATH Keywords: absolutely independent axiomatization
MaRDI profile type: Publication
cites work: Some old and new problems in the independence theory
cites work: "Flexible" Predicates of Formal Number Theory
description: scientific article; zbMATH DE number 4123697