Français
France
s'inscrire
Conseils d'eurolivre.fr
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
Livre conseillé
Actualités
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 18,55 €, prix le plus élevé: 26,66 €, prix moyen: 25,04 €
Boolean algebra - Source
Livre non disponible
(*)
Source:
Boolean algebra - Livres de poche

2012, ISBN: 1157680534

ID: 8773903326

[EAN: 9781157680536], Neubuch, [PU: Reference Series Books LLC Sep 2012], MATHEMATICS / ALGEBRA GENERAL, Neuware - Source: Wikipedia. Pages: 112. Chapters: Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function, Propositional formula, Boolean algebras canonically defined, Laws of Form, Canonical form, Truth table, Interior algebra, Relation algebra, Bent function, Bitwise operation, Karnaugh map, True quantified Boolean formula, Boolean-valued model, Field of sets, Boolean prime ideal theorem, Boolean data type, Functional completeness, Quine McCluskey algorithm, Complete Boolean algebra, Residuated Boolean algebra, Logic alphabet, Two-element Boolean algebra, Free Boolean algebra, Zhegalkin polynomial, Logical NOR, List of Boolean algebra topics, Shannon's expansion, Logical matrix, Parity function, Stone's representation theorem for Boolean algebras, Monadic Boolean algebra, Logic redundancy, Davis Putnam algorithm, Petrick's method, Wolfram axiom, Circuit minimization, Robbins algebra, Evasive Boolean function, 2-valued morphism, Algebraic normal form, Implicant, Boolean-valued function, Boolean domain, Absorption law, Correlation immunity, Conditioned disjunction, Implication graph, Consensus theorem, Lupanov representation, Boolean expression, Symmetric Boolean function, Modal algebra, Boolean conjunctive query, Derivative algebra, Reed-Muller expansion, Formula game, Stone functor, Chaff algorithm, Balanced boolean function, Product term. Excerpt: In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula. A propositional formula is constructed from simple propositions, such as 'x is greater than three' or propositional variables such as P and Q, using connectives such as NOT, AND, OR, and IMPLIES; for example: (x = 2 AND y = 4) IMPLIES x + y = 6.In mathematics, a propositional formula is often more briefly referred to as a 'proposition', but, more precisely, a propositional formula is not a proposition but a formal expression that denotes a proposition, a formal object under discussion, just like an expression such as '' is not a value, but denotes a value. In some contexts, maintaining the distinction may be of importance. For the purposes of the propositional calculus, propositions (utterances, sentences, assertions) are considered to be either simple or compound. Compound propositions are considered to be linked by sentential connectives, some of the most common of which are AND, OR, 'IF . THEN .', 'NEITHER . NOR.', '. IS EQUIVALENT TO .' . The linking semicolon ' ; ', and connective BUT are considered to be expressions of AND. A sequence of discrete sentences are considered to be linked by ANDs, and formal analysis applies a recursive 'parenthesis rule' with respect to sequences of simple propositions (see more below about well-formed formulas). For example: The assertion: 'This cow is blue. That horse is orange but this horse here is purple.' is actually a compound proposition linked by ANDs: ' ( ('This cow is blue' AND 'that horse is orange') AND 'this horse here is purple' ) '.Simple propositions are declarative in nature, that is, they make assertions about the condition or nature of a par. 112 pp. Englisch

Nouveaux livres Abebooks.de
BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Boolean algebra - Source
Livre non disponible
(*)
Source:
Boolean algebra - Livres de poche

2012, ISBN: 1157680534

ID: 8773901816

[EAN: 9781157680536], Neubuch, [PU: Reference Series Books LLC Sep 2012], MATHEMATICS / ALGEBRA GENERAL, Neuware - Source: Wikipedia. Pages: 112. Chapters: Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function, Propositional formula, Boolean algebras canonically defined, Laws of Form, Canonical form, Truth table, Interior algebra, Relation algebra, Bent function, Bitwise operation, Karnaugh map, True quantified Boolean formula, Boolean-valued model, Field of sets, Boolean prime ideal theorem, Boolean data type, Functional completeness, Quine McCluskey algorithm, Complete Boolean algebra, Residuated Boolean algebra, Logic alphabet, Two-element Boolean algebra, Free Boolean algebra, Zhegalkin polynomial, Logical NOR, List of Boolean algebra topics, Shannon's expansion, Logical matrix, Parity function, Stone's representation theorem for Boolean algebras, Monadic Boolean algebra, Logic redundancy, Davis Putnam algorithm, Petrick's method, Wolfram axiom, Circuit minimization, Robbins algebra, Evasive Boolean function, 2-valued morphism, Algebraic normal form, Implicant, Boolean-valued function, Boolean domain, Absorption law, Correlation immunity, Conditioned disjunction, Implication graph, Consensus theorem, Lupanov representation, Boolean expression, Symmetric Boolean function, Modal algebra, Boolean conjunctive query, Derivative algebra, Reed-Muller expansion, Formula game, Stone functor, Chaff algorithm, Balanced boolean function, Product term. Excerpt: In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula. A propositional formula is constructed from simple propositions, such as 'x is greater than three' or propositional variables such as P and Q, using connectives such as NOT, AND, OR, and IMPLIES; for example: (x = 2 AND y = 4) IMPLIES x + y = 6.In mathematics, a propositional formula is often more briefly referred to as a 'proposition', but, more precisely, a propositional formula is not a proposition but a formal expression that denotes a proposition, a formal object under discussion, just like an expression such as '' is not a value, but denotes a value. In some contexts, maintaining the distinction may be of importance. For the purposes of the propositional calculus, propositions (utterances, sentences, assertions) are considered to be either simple or compound. Compound propositions are considered to be linked by sentential connectives, some of the most common of which are AND, OR, 'IF . THEN .', 'NEITHER . NOR.', '. IS EQUIVALENT TO .' . The linking semicolon ' ; ', and connective BUT are considered to be expressions of AND. A sequence of discrete sentences are considered to be linked by ANDs, and formal analysis applies a recursive 'parenthesis rule' with respect to sequences of simple propositions (see more below about well-formed formulas). For example: The assertion: 'This cow is blue. That horse is orange but this horse here is purple.' is actually a compound proposition linked by ANDs: ' ( ('This cow is blue' AND 'that horse is orange') AND 'this horse here is purple' ) '.Simple propositions are declarative in nature, that is, they make assertions about the condition or nature of a par. 112 pp. Englisch

Nouveaux livres Abebooks.de
Rheinberg-Buch, Bergisch Gladbach, Germany [53870650] [Rating: 5 (von 5)]
NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Boolean algebra Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function - Source: Wikipedia (Herausgeber)
Livre non disponible
(*)
Source: Wikipedia (Herausgeber):
Boolean algebra Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function - nouveau livre

2012, ISBN: 1157680534

ID: A9790471

Kartoniert / Broschiert MATHEMATICS / Algebra / General, mit Schutzumschlag neu, [PU:Books LLC, Reference Series]

Nouveaux livres Achtung-Buecher.de
REDIVIVUS Buchhandlung Hanausch Reinhard, 93053 Regensburg
Frais d'envoiVersandkostenfrei innerhalb der BRD (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Boolean algebra Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function - Source: Wikipedia (Herausgeber)
Livre non disponible
(*)
Source: Wikipedia (Herausgeber):
Boolean algebra Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function - nouveau livre

2012, ISBN: 1157680534

ID: A9790471

Kartoniert / Broschiert MATHEMATICS / Algebra / General, con sovraccoperta neu, [PU:Books LLC, Reference Series]

Nouveaux livres Achtung-Buecher.de
MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
Frais d'envoiSpedizione gratuita in Germania. (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Boolean Algebra - Source Wikipedia; LLC Books; Books Group; LLC Books
Livre non disponible
(*)
Source Wikipedia; LLC Books; Books Group; LLC Books:
Boolean Algebra - Livres de poche

2011, ISBN: 9781157680536

ID: 14267156

Softcover, Buch, [PU: Books LLC, Wiki Series]

Nouveaux livres Lehmanns.de
Frais d'envoisofort lieferbar, , Versandkostenfrei innerhalb der BRD. (EUR 9.95)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

Détails sur le livre
Boolean algebra
Auteur:
Titre:
ISBN:

Source: Wikipedia. Pages: 112. Chapters: Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Boolean ring, Majority function, Exclusive or, Sheffer stroke, Negation, Boolean function, Propositional formula, Boolean algebras canonically defined, Laws of Form, Canonical form, Truth table, Interior algebra, Relation algebra, Bent function, Bitwise operation, Karnaugh map, True quantified Boolean formula, Boolean-valued model, Field of sets, Boolean prime ideal theorem, Boolean data type, Functional completeness, Quine-McCluskey algorithm, Complete Boolean algebra, Residuated Boolean algebra, Logic alphabet, Two-element Boolean algebra, Free Boolean algebra, Zhegalkin polynomial, Logical NOR, List of Boolean algebra topics, Shannon's expansion, Logical matrix, Parity function, Stone's representation theorem for Boolean algebras, Monadic Boolean algebra, Logic redundancy, Davis-Putnam algorithm, Petrick's method, Wolfram axiom, Circuit minimization, Robbins algebra, Evasive Boolean function, 2-valued morphism, Algebraic normal form, Implicant, Boolean-valued function, Boolean domain, Absorption law, Correlation immunity, Conditioned disjunction, Implication graph, Consensus theorem, Lupanov representation, Boolean expression, Symmetric Boolean function, Modal algebra, Boolean conjunctive query, Derivative algebra, Reed-Muller expansion, Formula game, Stone functor, Chaff algorithm, Balanced boolean function, Product term. Excerpt: In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula. A propositional formula is constructed from simple propositions, such as "x is greater than three" or propositional variables such as P and Q, using connectives such as NOT, AND, OR, and IMPLIES; for example: (x = 2 AND y = 4) IMPLIES x + y = 6.In mathematics, a propositional formula is often more briefly referred to as a "proposition", but, more precisely, a propositional formula is not a proposition but a formal expression that denotes a proposition, a formal object under discussion, just like an expression such as "" is not a value, but denotes a value. In some contexts, maintaining the distinction may be of importance. For the purposes of the propositional calculus, propositions (utterances, sentences, assertions) are considered to be either simple or compound. Compound propositions are considered to be linked by sentential connectives, some of the most common of which are AND, OR, "IF ... THEN ...", "NEITHER ... NOR...", "... IS EQUIVALENT TO ..." . The linking semicolon " ; ", and connective BUT are considered to be expressions of AND. A sequence of discrete sentences are considered to be linked by ANDs, and formal analysis applies a recursive "parenthesis rule" with respect to sequences of simple propositions (see more below about well-formed formulas). For example: The assertion: "This cow is blue. That horse is orange but this horse here is purple." is actually a compound proposition linked by ANDs: " ( ("This cow is blue" AND "that horse is orange") AND "this horse here is purple" ) ".Simple propositions are declarative in nature, that is, they make assertions about the condition or nature of a par...

Informations détaillées sur le livre - Boolean algebra


EAN (ISBN-13): 9781157680536
ISBN (ISBN-10): 1157680534
Livre de poche
Date de parution: 20111118
Editeur: Books LLC, Reference Series
112 Pages
Poids: 0,232 kg
Langue: Englisch

Livre dans la base de données depuis 20.10.2010 18:36:24
Livre trouvé récemment le 12.11.2017 20:54:41
ISBN/EAN: 1157680534

ISBN - Autres types d'écriture:
1-157-68053-4, 978-1-157-68053-6


< pour archiver...
Livres en relation