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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Crociani and M. Moscucci, Una traduzione algebraica di un concetto logico di indipendenza, Matematiche (Catania) 36 (1981) no. 2, pp. 261–280.
K. Glazek, Some old and new problems in the independence theory, Colloquium Mathematicum 42 (1979), pp. 127–189.
G. Grätzer, Universal algebra, Princeton 1967.
S. Kripke, “Flexible” predicates of formal number theory, Proceedings of American Mathematical Society 13 (1963), pp. 647–650.
A. Tarski, Über einige fundamentalle Begriffe der Metamathematik, Comtes Rendus des Seances de la Societe des Sciences et des Letres de Varsovie 23 (1930), pp. 22–29, English translation by J. H. Woodger in Logic, Semantics, Metamathematics, The Carendon Press, Oxford 1956.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grygiel, J. Absolutely independent axiomatizations for countable sets in classical logic. Stud Logica 48, 77–84 (1989). https://doi.org/10.1007/BF00370635
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370635