SFr. 36.50
€ 39.42
BTC 0.0006
LTC 0.483
ETH 0.0123


bestellen

Artikel-Nr. 9229558


Diesen Artikel in meine
Wunschliste
Diesen Artikel
weiterempfehlen
Diesen Preis
beobachten

Weitersagen:


Herausgeber: 
  • Source: Wikipedia
  • Boolean algebra: Sigma-algebra, Boolean satisfiability problem, De Morgan's laws, Propositional calculus, Logical conjunction, Logical disjunction, Bo 
     

    (Buch)
    Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!


    Übersicht

    Auf mobile öffnen
     
    Lieferstatus:   i.d.R. innert 5-10 Tagen versandfertig
    Veröffentlichung:  September 2012  
    Genre:  Schulbücher 
    ISBN:  9781157680536 
    EAN-Code: 
    9781157680536 
    Verlag:  Books LLC, Reference Series 
    Einband:  Kartoniert  
    Sprache:  English  
    Dimensionen:  H 246 mm / B 189 mm / D 7 mm 
    Gewicht:  234 gr 
    Seiten:  112 
    Zus. Info:  Paperback 
    Bewertung: Titel bewerten / Meinung schreiben
    Inhalt:
    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...

      
     Empfehlungen... 
     Schaum's Outline of Boolean Algebra and Switching - (Buch)
     Biological Sequence Matching: Using Boolean Algebr - (Buch)
     Boolean Algebra Is for Children - (Buch)
     Ones and Zeros: Understanding Boolean Algebra, Dig - (Buch)
     Boolean Algebra Is for Children - (Buch)
     Boolean Algebra: Applied in Analyzing Resistive Ci - (Buch)
     Boolean Algebra and Its Applications - (Buch)
     Boolean Algebra and Its Applications - (Buch)
     Introduction to the Comparative Method with Boolea - (Buch)
     Boolean Algebra and Its Applications - (Buch)
     Weitersuchen in   DVD/FILME   CDS   GAMES   BÜCHERN   



    Wird aktuell angeschaut...
     

    Zurück zur letzten Ansicht


    AGB | Datenschutzerklärung | Mein Konto | Impressum | Partnerprogramm
    Newsletter | 1Advd.ch RSS News-Feed Newsfeed | 1Advd.ch Facebook-Page Facebook | 1Advd.ch Twitter-Page Twitter
    Forbidden Planet AG © 1999-2024
    Alle Angaben ohne Gewähr
     
    SUCHEN

     
     Kategorien
    Im Sortiment stöbern
    Genres
    Hörbücher
    Aktionen
     Infos
    Mein Konto
    Warenkorb
    Meine Wunschliste
     Kundenservice
    Recherchedienst
    Fragen / AGB / Kontakt
    Partnerprogramm
    Impressum
    © by Forbidden Planet AG 1999-2024
    Jetzt auch mit LiteCoin bestellen!