Abstract
We extend some results of Adam Kolany to show that large sets of satisfiable sentences generally contain equally large subsets of mutually consistent sentences. In particular, this is always true for sets of uncountable cofinality, and remains true for sets of denumerable cofinality if we put appropriate bounding conditions on the sentences. The results apply to both the propositional and the predicate calculus. To obtain these results, we use delta sets for regular cardinals, and, for singular cardinals, a generalization of delta sets. All of our results are theorems in ZFC.
Similar content being viewed by others
References
GÖdel, K. (1930), ‘Die Vollständigkeit der Axiome des logischen Funktionenkalküls’, Monatsh. Math. Phys. 37 349-360.
Henkin, Leon. (1949), ‘The completeness of the first-order functional calculus’, JSL 14.
Jech, T. (1978), Set Theory, Academic Press, Inc.
Kolany, A. (1999), ‘Big sets of propositional formulas’, unpublished.
Mendelson, E. (1997), Introduction to Mathematical Logic, Fourth Edition, Chapman and Hall, London.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hechler, S.H. On Consistent Subsets of Large Sets of Satisfiable Sentences. Studia Logica 69, 339–349 (2001). https://doi.org/10.1023/A:1013888009283
Issue Date:
DOI: https://doi.org/10.1023/A:1013888009283