|Bivalence: the division in the evaluation of statements on two possible values. These can be interpreted as "true" and "false", but also can be interpreted differently. In multivalued logic there are three to infinitely many values. See also probabilities._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
Books on Amazon
|Berka I 31f
Bivalence/Logical Form/Peirce: the fact that the sentence X is either true or false is written as: (x - f)(w - x) = 0 - Execution/(s): a) x = w : (1 - 0)(1 - 1) = 0 - b) x = f: (0 - 0)(0 - 0) = 0.
Therefore, (x - f)(w - y) = 0 means that either x is false or y is true. - That is the same as "if x is true, y is true" - ((s) This corresponds to equivalence: Always the same truth value because of 1) presumed bivalence - 2) exclusionary or) - ((s) Bivalence/(s) couples x and y together, without any contentual determination, simply because merely one other truth value remains, which is thus determined.) - (>equivalence)._____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution.
Ch. S. Peirce
Philosophical Writings 2011
K. Berka/L. Kreiser
Logik Texte Berlin 1983