Content deleted Content added
m Dated {{Disputed-inline}} x 4{{Off-topic?}}. (Build p607) |
Incnis Mrsi (talk | contribs) cardinality and cartesian product are off-topic. set difference is derived: A−B = A ∧ ¬B |
||
Line 22:
* The '''empty set''' or '''null set''' is the set of no elements, denoted by <math>\varnothing</math> and sometimes 0.
* A '''unary operator''' applies to a single set. There
* A '''binary operator''' applies to two sets. The basic binary operators are logical '''OR''' and logical '''AND'''. They perform the [[union (set theory)|union]] and [[intersection (set theory)|intersection]] of sets.
There are also other derived binary operators, such as '''XOR''' (exclusive OR, i.e., "one or the other, but not both"), and set difference, '''
* A '''subset''' is denoted by <math>A \subseteq B</math> and means every element in set A is also in set B.
Line 124:
* In the case of simultaneous equations, they are connected with an implied logical AND:
::(4x + y = 2) ''and'' (2x
* Similarly, for simultaneous '''in'''equalities:
::(x + y < 2) ''and'' (x
* Both the greater-than-or-equals and less-than-or-equals inequalities are most often implicitly have an ''OR'' boolean joining them:
Line 138:
::(Width ± 3) means
::(Width = 3) ''or'' (Width =
==English language use of Boolean terms==
Line 202:
"Search term 1" OR "Search term 2"
*The minus sign (approximated as a [[hyphen]]) is used for logical NOT (AND NOT):
"Search term 1" -"Search term 2"
|