[permalink] [id link]
Skolem ( 1922 ) pointed out the seeming contradiction between the Löwenheim – Skolem theorem on the one hand, which implies that there is a countable model of Zermelo's axioms, and Cantor's theorem on the other hand, which states that uncountable sets exist, and which is provable from Zermelo's axioms.
from
Wikipedia
Some Related Sentences
Skolem and 1922
1920: Thoralf Skolem corrected Löwenheim's proof of what is now called the downward Löwenheim-Skolem theorem, leading to Skolem's paradox discussed in 1922 ( the existence of countable models of ZF, making infinite cardinalities a relative property.
Skolem ( 1922 ) refined Zermelo's axioms for set theory by replacing Zermelo's vague notion of a " definite " property with any property that can be coded in first-order logic.
Thoralf Skolem ( 1922 ) was the first to discuss the seemingly contradictory aspects of the theorem, and to discover the relativity of set-theoretic notions now known as non-absoluteness.
Although it is not an actual antinomy like Russell's paradox, the result is typically called a paradox, and was described as a " paradoxical state of affairs " by Skolem ( 1922: p. 295 ).
A mathematical explanation of the paradox, showing that it is not a contradiction in mathematics, was given by Skolem ( 1922 ).
" ( Skolem 1922, p. 295, translation by Bauer-Mengelberg )
* Skolem, Thoralf ( 1922 ).
Skolem and pointed
Skolem also pointed out that a consequence of the Löwenheim – Skolem theorem is what is now known as Skolem's paradox: If Zermelo's axioms are consistent, then they must be satisfiable within a countable domain, even though they prove the existence of uncountable sets.
Skolem and out
Skolem ( 1923 ) sets out his primitive recursive arithmetic, a very early contribution to the theory of computable functions, as a means of avoiding the so-called paradoxes of the infinite.
Skolem and seeming
In mathematical logic and philosophy, Skolem's paradox is a seeming contradiction that arises from the downward Löwenheim – Skolem theorem.
Skolem and contradiction
Skolem went on to explain why there was no contradiction.
Skolem and between
Many consequences of the Löwenheim – Skolem theorem seemed counterintuitive to logicians in the early 20th century, as the distinction between first-order and non-first-order properties was not yet understood.
Skolem and Löwenheim
In 1920, Thoralf Skolem simplified a previous result by Leopold Löwenheim, leading to the Löwenheim – Skolem theorem and, in 1930, to the notion of a Herbrand universe and a Herbrand interpretation that allowed ( un ) satisfiability of first-order formulas ( and hence the validity of a theorem ) to be reduced to ( potentially infinitely many ) propositional satisfiability problems.
First-order logic also satisfies several metalogical theorems that make it amenable to analysis in proof theory, such as the Löwenheim – Skolem theorem and the compactness theorem.
Examples of early theorems from classical model theory include Gödel's completeness theorem, the upward and downward Löwenheim – Skolem theorems, Vaught's two-cardinal theorem, Scott's isomorphism theorem, the omitting types theorem, and the Ryll-Nardzewski theorem.
The compactness theorem is one of the two key properties, along with the downward Löwenheim – Skolem theorem, that is used in Lindström's theorem to characterize first-order logic.
A second application of the compactness theorem shows that any theory that has arbitrarily large finite models, or a single infinite model, has models of arbitrary large cardinality ( this is the Upward Löwenheim – Skolem theorem ).
* Löwenheim – Skolem theorem, a theorem in first-order logic dealing with the cardinality of models
It follows from the compactness theorem and the upward Löwenheim – Skolem theorem that it is not possible to characterize finiteness or countability, respectively, in first-order logic.
In mathematical logic, the Löwenheim – Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first-order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ.
The ( downward ) Löwenheim – Skolem theorem is one of the two key properties, along with the compactness theorem, that are used in Lindström's theorem to characterize first-order logic.
In general, the Löwenheim – Skolem theorem does not hold in stronger logics such as second-order logic.
In its general form, the Löwenheim – Skolem Theorem states that for every signature σ, every infinite σ-structure M and every infinite cardinal number κ ≥ | σ | there is a σ-structure N such that | N |
The part of the theorem asserting that a structure has elementary substructures of all smaller infinite cardinalities is known as the downward Löwenheim – Skolem Theorem.
The part of the theorem asserting that a structure has elementary extensions of all larger cardinalities is known as the upward Löwenheim – Skolem Theorem.
The Löwenheim – Skolem theorem shows that these axiomatizations cannot be first-order.
The Löwenheim – Skolem theorem dealt a first blow to this hope, as it implies that a first-order theory which has an infinite model cannot be categorical.
Finally, Anatoly Ivanovich Maltsev ( Анато ́ лий Ива ́ нович Ма ́ льцев, 1936 ) proved the Löwenheim – Skolem theorem in its full generality.
Therefore the general theorem is sometimes known as the Löwenheim – Skolem – Tarski theorem.
The Löwenheim – Skolem theorem is treated in all introductory texts on model theory or mathematical logic.
Skolem and –
* 1887 – Thoralf Skolem, Norwegian mathematician ( d. 1963 )
* March 23 – Thoralf Skolem, Norwegian mathematician ( b. 1887 )
* Burris, Stanley N., Downward Löwenheim – Skolem theorem
Skolem and on
Initial approaches relied on the results of Herbrand and Skolem to convert a first-order formula into successively larger sets of propositional formulae by instantiating variables with terms from the Herbrand universe.
Thoralf Skolem ( 1920 ) gave a correct proof using formulas in what would later be called Skolem normal form and relying on the axiom of choice:
Thoralf Albert Skolem ( 23 May 1887 – 23 March 1963 ) () was a Norwegian mathematician known mainly for his work on mathematical logic and set theory.
In 1913, Skolem passed the state examinations with distinction, and completed a dissertation titled Investigations on the Algebra of Logic.
Skolem published around 180 papers on Diophantine equations, group theory, lattice theory, and most of all, set theory and mathematical logic.
Skolem was among the first to write on lattices.
It is notable that Skolem, like Löwenheim, wrote on mathematical logic and set theory employing the notation of his fellow pioneering model theorists Charles Sanders Peirce and Ernst Schröder, including ∏, ∑ as variable-binding quantifiers, in contrast to the notations of Peano, Principia Mathematica, and Principles of Mathematical Logic.
The Source Book underrated the algebraic logic of De Morgan, Boole, Peirce, and Schröder, but devoted more pages to Skolem than to anyone other than Frege, and included Löwenheim ( 1915 ), the founding paper on model theory.
In this form, all quantification becomes implicit: universal quantifiers on variables ( X, Y, …) are simply omitted as understood, while existentially-quantified variables are replaced by Skolem functions.
0.108 seconds.