Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Skolem, Thoralf (1887–1963)

View through CrossRef
The twentieth-century mathematician Thoralf Skolem is known principally for two achievements. The first is the statement and proof of the Löwenheim-Skolem theorem. The second is his construction of countable nonstandard models of Peano arithmetic and set theory when these theories are expressed in first-order (predicate) logic. The Löwenheim-Skolem theorem, for which Skolem gave several proofs, showed that no first-order axiom system can characterise a unique infinite model. Skolem regarded this theorem as casting doubt on the belief that mathematics can be reliably founded on formal axiomatic systems alone. He discovered that first-order logics are necessarily incomplete descriptions of their intended models. There is a vivid contrast between the comprehensive syntactic expressive power of first-order theories and their very limited power to constrain their models to a priori desired models. The startling conclusion he derived from his theorem is known as ‘Skolem’s paradox’. It asserts that concepts such as cardinality must be interpreted relative to a given model and thus have no absolute meaning. Anticipating modern model theory, in a later paper he gave a direct construction of a nonstandard model of first-order arithmetic based on plus and times by a method which anticipated the ultraproduct construction of models of first-order theories. He realised that it might be possible to construct new models for set theory which demonstrate the consistency or the independence of the axiom of choice and the continuum hypothesis. The first goal was realised in the early 1930s by Kurt Gödel’s introduction of the notion of constructability for consistency proofs. The second goal was realised in the early 1960s by Paul Cohen’s introduction of the notion of forcing for independence proofs, for which he was awarded the Field’s medal in 1966.
Title: Skolem, Thoralf (1887–1963)
Description:
The twentieth-century mathematician Thoralf Skolem is known principally for two achievements.
The first is the statement and proof of the Löwenheim-Skolem theorem.
The second is his construction of countable nonstandard models of Peano arithmetic and set theory when these theories are expressed in first-order (predicate) logic.
The Löwenheim-Skolem theorem, for which Skolem gave several proofs, showed that no first-order axiom system can characterise a unique infinite model.
Skolem regarded this theorem as casting doubt on the belief that mathematics can be reliably founded on formal axiomatic systems alone.
He discovered that first-order logics are necessarily incomplete descriptions of their intended models.
There is a vivid contrast between the comprehensive syntactic expressive power of first-order theories and their very limited power to constrain their models to a priori desired models.
The startling conclusion he derived from his theorem is known as ‘Skolem’s paradox’.
It asserts that concepts such as cardinality must be interpreted relative to a given model and thus have no absolute meaning.
Anticipating modern model theory, in a later paper he gave a direct construction of a nonstandard model of first-order arithmetic based on plus and times by a method which anticipated the ultraproduct construction of models of first-order theories.
He realised that it might be possible to construct new models for set theory which demonstrate the consistency or the independence of the axiom of choice and the continuum hypothesis.
The first goal was realised in the early 1930s by Kurt Gödel’s introduction of the notion of constructability for consistency proofs.
The second goal was realised in the early 1960s by Paul Cohen’s introduction of the notion of forcing for independence proofs, for which he was awarded the Field’s medal in 1966.

Related Results

Thoralf Skolem
Thoralf Skolem
Abstract This item is a handwritten letter, dated 1 November 1931, addressed to a “Sehr geehrter Herr Professor.” From the contents of the letter, in particular from...
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan pada suatu graph adalah pemetaan yang memetakan unsur-unsur graph yaitu himpunan titik, himpunan sisi, maupun himpunan titik dan sisi ke suatu bilangan asli dengan aturan...
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, t...
Skolem Mean Labeling of Four Star Graphs
Skolem Mean Labeling of Four Star Graphs
Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η  1 and  1 2   is a skolem mean graph if 2 2 1 1        1 2 i i i i   is t...
Skolem Difference Mean Graphs
Skolem Difference Mean Graphs
A graph G = (V, E) with p vertices and q edges is said to haveskolem difference mean labeling if it is possible to label the verticesx ∈ V with distinct elements f(x) from 1, 2, 3,...
The Thoralf plugin: for your fancy type needs
The Thoralf plugin: for your fancy type needs
Many fancy types (e.g., generalized algebraic data types, type families) require a type checker plugin. These fancy types have a type index (e.g., type level natural numbers) with ...
Besprechungen
Besprechungen
Book reviewed in this article:Emlen, J. T. jr. (1963): Determinance of cliff edge and escape responses in Herring Gull chicks in nature.Eisenberg, J. F. (1963): A comparative study...
Skolem Graceful Labelin on Broom Graph
Skolem Graceful Labelin on Broom Graph
Let G=(V,E) be a finite simple graph. Broom graph B_(m,n) consist of (m+n) nodes is a path graph P_m with m nodes and a star graph S_n with (n+1) nodes, which are aligned at 1 vert...

Back to Top