The Decline of String-Manipulation Logic and Mathematics (optional material, p. 2)
A Paradox Arising from "String-Manipulation" Logic
We assume here certain basic logical premises:
~(a
~a) A proposition cannot be both true and false.
a
(a
a) If a is true, then "a and a" is true.
((a
b)
(b
c))
(a
c) If a implies b and b implies c, then a implies c.
(a
b)
(~b
~a) If a implies b, then not-b implies not-a.
Define x as the string '~x'.
Then x
(x
x) by (1b)
(x
~x) by substitution from (2)
Hence x
(x
~x) by application of (1c) to (3)
Consequently ~(x
~x)
~x by application of (1d) to (4)
~(x
~x) by (1a)
Therefore ~x from (5) and (6)
Therefore x by substitution from (2)
Hence x
~x combining (7) and (8)
But (9) is impossible! by (1a)
Previous