Functional Completeness: Logic, Logical connective, Boolean function, Truth table, Boolean expression, Logical conjunction, Logical disjunction, Logical negation, Binary operation, Sheffer stroke - Couverture souple

Couverture souple

ISBN 10 : 6130054149 ISBN 13 : 9786130054144

Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.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.

Détails de l'édition

• Éditeur: Alphascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6130054149
• ISBN 13: 9786130054144
• Reliure: Broché
• Nombre de pages: 96
• Éditeur: Miller Frederic P., Vandome Agnes F., McBrewster John
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible