- disjunction gate
- вентиль [схема] логического сложения;
схема функции дизъюнкции
Большой англо-русский и русско-английский словарь. 2001.
disjunction gate
Смотреть что такое "disjunction gate" в других словарях:
Logical disjunction — Disjunction redirects here. For separation of chromosomes, see Meiosis. For disjunctions in distribution, see Disjunct distribution. Venn diagram of the logical disjunction of A and B … Wikipedia
OR gate — This article is about OR in the sense of an electronic logic gate (e.g. CMOS 4071). For OR in the purely logical sense, see Logical disjunction. INPUT A B OUTPUT A + B 0 0 0 0 1 1 1 0 1 … Wikipedia
XOR gate — The XOR gate (sometimes EOR gate) is a digital logic gate that implements exclusive disjunction it behaves according to the truth table to the right. A HIGH output (1) results if one, and only one, of the inputs to the gate is HIGH (1). If both… … Wikipedia
элемент ИЛИ — [Интент] (логический) элемент ИЛИ (логическая) схема ИЛИ схема логического сложения — [Я.Н.Лугинский, М.С.Фези Жилинская, Ю.С.Кабиров. Англо русский словарь по электротехнике и электроэнергетике, Москва] Параллельные тексты EN RU OR element … Справочник технического переводчика
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Exclusive or — The logical operation exclusive disjunction, also called exclusive or (symbolized XOR or EOR), is a type of logical disjunction on two operands that results in a value of “true” if and only if exactly one of the operands has a value of “true”. [… … Wikipedia
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
Sheffer stroke — This article is about the logical NAND operator. For the electronic NAND gate, see Negated AND gate. For other uses, see Nand (disambiguation). Venn diagram of In Boolean functions and propositional calculus, the Sheffer stroke, named after … Wikipedia
Greyhawk — This article is about the role playing game setting. For other uses, see Greyhawk (disambiguation). Greyhawk Designer(s) Gary Gygax Publisher(s) TSR, Inc. Wizards of the Coast Publication date … Wikipedia
