You are not currently logged in.
Access JSTOR through your library or other institution:
Absolutely Independent Axiomatizations for Countable Sets in Classical Logic
Studia Logica: An International Journal for Symbolic Logic
Vol. 48, No. 1 (Mar., 1989), pp. 77-84
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015408
Page Count: 8
You can always find the topics here!Topics: Algebra, Polynomials, Axiomatization, Universal algebra, Boolean algebras, Abstract algebra, Property partitioning, Abstract logic, Mathematics, Intuitionistic logic
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
The notion of absolute independence, considered in this paper has a clear algebraic meaning and is a strengthening of the usual notion of logical independence. We prove that any consistent and countable set in classical propositional logic has an absolutely independent axiomatization.
Studia Logica: An International Journal for Symbolic Logic © 1989 Springer