Absolutely independent axiomatizations for countable sets in classical logic

Studia Logica 48 (1):77 - 84 (1989)
  Copy   BIBTEX

Abstract

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 prepositional logic has an absolutely independent axiornatization.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Linear independence without choice.Douglas Bridges, Fred Richman & Peter Schuster - 1999 - Annals of Pure and Applied Logic 101 (1):95-102.
Remarks on the NIP in a model.Karim Khanaki & Anand Pillay - 2018 - Mathematical Logic Quarterly 64 (6):429-434.
The γ-borel conjecture.Arnold W. Miller - 2005 - Archive for Mathematical Logic 44 (4):425-434.
Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.
Adaptive Fregean Set Theory.Diderik Batens - 2020 - Studia Logica 108 (5):903-939.
Hechler’s theorem for the null ideal.Maxim R. Burke & Masaru Kada - 2004 - Archive for Mathematical Logic 43 (5):703-722.

Analytics

Added to PP
2009-01-28

Downloads
27 (#830,567)

6 months
10 (#420,145)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Explicating Logical Independence.Lloyd Humberstone - 2020 - Journal of Philosophical Logic 49 (1):135-218.

Add more citations

References found in this work

No references found.

Add more references