Re:Where do type systems come from? (2017)
by ProfHewitt on Friday October 01, 2021 @03:47PM
(#28722630)
Bertrand Russell introduced orders on propositions to block
construction of paradoxes such as “The Liar” [Russell 1908].
Without orders on propositions, the “self-referential”
proposition I’mFalse (such that
I’mFalse⇔¬I’mFalse) could be constructed using the
following recursive definition:
I’mFalse:Proposition<i>≡¬I’mFalse. Since Ψ is a
propositional variable in the definition, ¬Ψ:Proposition <i+1>. Consequently,
I’mFalse:Proposition <i>⇒I’mFalse:Proposition<i+1>, which
is a contradiction.
For more information see the following:
Re:Where do type systems come from? (2017)
by __MatrixMan__ on Friday October 01, 2021 @11:44AM
(#28719907)
The distinction between countable and uncountable infinities also stems from the liar's paradox.
Re:Where do type systems come from? (2017)
by Koshkin on Friday October 01, 2021 @05:08PM
(#28723395)
How so? The set of reals is uncountably infinite. Looks like a self-contained fact (that can be proved by a "diagonal argument").
Re:Where do type systems come from? (2017)
by kazinator on Friday October 01, 2021 @08:50PM
(#28724984)
But diagonalization and self-referential paradoxes are related (in ways that are not necessarily obvious).
Think along the lines that you have some sentence Px which asserts that sentence Py is false. Now imagine a table where both the rows and columns are P0, P1, P2, .. populated with these sentences. The diagonal is where you have the self-reference: Pi asserting that Pi is false.
1. Bertrand Russell studied the "I am lying" paradox, which I always thought was nothing more than a clever meme. 2. Bertrand Russell is responsible for type theory 3. That type theory came out of his study of the paradox.