💡 Words with a Similar Meaning to "Boolean logic"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| boolean algebranoun | (algebra, logic, computing) Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or "true" and "false") and are subject to operations based on AND, OR and NOT |
| boolean functionnoun | (algebra, logic, computing) Any function based on the operations AND, OR and NOT, and whose elements are from the domain of Boolean algebra |
| boolean variablenoun | (mathematics, logic, computing) Any variable, from the domain of Boolean algebra, having one of only two values |
| booleannoun | (logic, computing) Pertaining to data items that can have “true” and “false” (or, equivalently, 1 and 0 respectively) as their only possible values and to operations on such values. |
| boolean latticenoun | (algebra) The lattice corresponding to a Boolean algebra. |
| switching algebranoun | two-element Boolean algebra |
| predicate logicnoun | (logic) First-order logic. |
| boolean atomnoun | (logic) A logical proposition that cannot be derived from other logical propositions by a Boolean operation. |
| logicnoun | (uncountable) A method of human thought that involves thinking in a linear, step-by-step manner about how a problem can be solved. Logic is the basis of many principles including the scientific method. |
| computability logicnoun | (computing, mathematics) a formal theory of computability |
| sublogicnoun | (mathematics) A subset of a system of logic |
| truth functionnoun | (mathematics, logic) A Boolean function whose value is interpreted as truth or falsity |
| switching functionnoun | (logic) Synonym of Boolean function. |
| logical calculusnoun | (logic) A formal system. |
| combinatory logicnoun | (computer science) Model of computation based on combinators. |
| free boolean algebranoun | (algebra) A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are "true" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms. |
| positive logicnoun | (logic) A logical system or fragment thereof not containing a negation operator. |
| linear logicnoun | (logic) A logic in which two structural rules are missing from its sequent calculus: those for weakening and contraction; which has some extra logical connectives, so that it has both "additive" and "multiplicative" versions of the typical binary connectives and truth constants; and which has a pair of modal, "exponential" operators for resource management, to help make up for the loss of the two structural rules. |
| not operatornoun | (mathematics, logic) An operation on logical values that changes true to false, and false to true. |
| formal logicnoun | (logic) Mathematical logic. |
Translate “Boolean logic” into Another Language
Pick a language — the word will be pre-filled in the translator.