Finite-valued logic
In logic, a finite-valued logic (also finitely many-valued logic) is a propositional calculus in which truth values are discrete. Traditionally, in Aristotle's logic, the bivalent logic, also known as binary logic was the norm, as the law of the excluded middle precluded more than two possible values (i.e., "true" and "false") for any proposition. Modern three-valued logic (ternary logic) allows for an additional possible truth value (i.e. "undecided").
Wikipage redirect
primaryTopic
Finite-valued logic
In logic, a finite-valued logic (also finitely many-valued logic) is a propositional calculus in which truth values are discrete. Traditionally, in Aristotle's logic, the bivalent logic, also known as binary logic was the norm, as the law of the excluded middle precluded more than two possible values (i.e., "true" and "false") for any proposition. Modern three-valued logic (ternary logic) allows for an additional possible truth value (i.e. "undecided").
has abstract
In logic, a finite-valued logi ...... has a computational semantics.
@en
Wikipage page ID
57,435,582
page length (characters) of wiki page
Wikipage revision ID
1,011,989,942
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In logic, a finite-valued logi ...... ruth value (i.e. "undecided").
@en
label
Finite-valued logic
@en