Graduate studies at Western
In Edward N. Zalta (ed.), Stanford Encyclopedia of Philosophy (2009)
|Abstract||Skolem's Paradox involves a seeming conflict between two theorems from classical logic. The Löwenheim Skolem theorem says that if a first order theory has infinite models, then it has models whose domains are only countable. Cantor's theorem says that some sets are uncountable. Skolem's Paradox arises when we notice that the basic principles of Cantorian set theory—i.e., the very principles used to prove Cantor's theorem on the existence of uncountable sets—can themselves be formulated as a collection of first order sentences. How can the very principles which prove the existence of uncountable sets be satisfied by a model which is itself only countable? How can a countable model satisfy the first order sentence which says that there are uncountably many mathematical objects—e.g., uncountably many real numbers?|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Marek Zawadowski (1983). The Skolem-Löwenheim Theorem in Toposes. Studia Logica 42 (4):461 - 475.
Ignagio Jane (2001). Reflections on Skolem's Relativity of Set-Theoretical Concepts. Philosophia Mathematica 9 (2):129-153.
Timothy Bays (2006). The Mathematics of Skolem's Paradox. In Dale Jacquette (ed.), Philosophy of Logic.
Saharon Shelah (1978). End Extensions and Numbers of Countable Models. Journal of Symbolic Logic 43 (3):550-562.
Stathis Livadas (2013). Are Mathematical Theories Reducible to Non-Analytic Foundations? Axiomathes 23 (1):109-135.
Alexander George (1985). Skolem and the Löwenheim-Skolem Theorem: A Case Study of the Philosophical Significance of Mathematical Results. History and Philosophy of Logic 6 (1):75-89.
Jan Von Plato (2007). In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs. Bulletin of Symbolic Logic 13 (2):189-225.
Marek Zawadowski (1985). The Skolem-Löwenheim Theorem in Toposes. II. Studia Logica 44 (1):25 - 38.
Laureano Luna & William Taylor (2010). Cantor's Proof in the Full Definable Universe. Australasian Journal of Logic 9:11-25.
Added to index2009-01-28
Total downloads20 ( #68,257 of 732,277 )
Recent downloads (6 months)1 ( #61,087 of 732,277 )
How can I increase my downloads?