Emil said:
1. Sentence 1 = "sentence 2 is not true".
2. Sentence 2 = "sentence 1 is not true"
Binary choice--not sequenced values:
Choice (1)= Sentence 1 is true
Choice (0)= Sentence 1 is not true
Choice (11)= Sentence 2 is true.
Choice (00)= Sentence 2 is not true
Sentence 1 = "sentence 2 is not true".
Sentence 2 = "sentence 1 is not true"
[unstable logic state]
Sentence 1 = "sentence 2 is not true" = [Sentence 1 = (00)]
If [sentence 1 = (00)], then:
Sentence 2 = "sentence 1 is not true" = [Sentence 2 = (0)] [logic gate switches to]:
[Sentence 2 = (1)]
If [Sentence 2 = (1)], then,
[Sentence 1 = (00)] [logic gate switches to]:
[Sentence 1 = (11)]
If [Sentence 1 = (11)], and, [Sentence 2 = (1)], then
[Sentence 1 = (11)], and, [Sentence 2 = (1)] =
[stable logic state]
sigurdv said:
To produce paradox it must be corrected:
1. Sentence 1 = "sentence 2 is not true".
2. Sentence 2 = "sentence 1 is true"
[unstable logic state]
Sentence 1 = "sentence 2 is not true" = [Sentence 1 = (00)]
If [sentence 1 = (00)], then:
Sentence 2 = "sentence 1 is true" = [Sentence 2 = (1)] [logic gate switches to]:
[Sentence 2 = (0)]
If [Sentence 2 = (0)], then,
[Sentence 1 = (00)] [logic gate switches to]:
[Sentence 1 = (11)]
If [Sentence 1 = (11)], then,
[Sentence 2 = (0)] [logic gate switches to]:
[Sentence 2 = (1)]
If [Sentence 1 = (11)], and, [Sentence 2 = (1)], then
[Sentence 1 = (11)], and, [Sentence 2 = (1)] =
[stable logic state]