Functional Completeness
CHF 42.90
Auf Lager
SKU
JRB1BD7LMOT
1 Verfügbar
Geliefert zwischen Mi., 24.09.2025 und Do., 25.09.2025
Details
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well known complete set of connectives is { AND, OR, NOT }, consisting of binary conjunction, binary disjunction and negation. The set consisting only of the binary operator NAND is also functionally complete. In a context of propositional logic, functionally complete sets of connectives are also called (expressively) adequate.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130054144
- Genre Psychologie
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- Anzahl Seiten 96
- EAN 9786130054144
- Format Fachbuch
- Titel Functional Completeness
- Herausgeber Alphascript Publishing
Bewertungen
Schreiben Sie eine Bewertung
