vault backup: 2026-02-27 14:37:15
This commit is contained in:
@@ -25,4 +25,4 @@ A function is _surjective_ if every element $y in Y$ has _at minimum_ one matchi
|
||||
|
||||
### Bijectivity
|
||||
A function is _bijective_ if every element $y in Y$ has _exactly_ one matching $x in X$ (it is _injective_ and _surjective_)
|
||||
- $forall y in Y, exists excl x in X : f(x) = ySymbol$
|
||||
- $forall y in Y, exists excl x in X : f(x) = y$
|
||||
@@ -12,4 +12,4 @@
|
||||
| --------- | --------------------------------------- | -------------- |
|
||||
| **nand** | $p$ and $q$ are not both true | $not(p and q)$ |
|
||||
| **nor** | neither of $p$ and $q$ are true | $not(p or q)$ |
|
||||
| **xnor** | $p$ and $q$ are both false or both true | |
|
||||
| **xnor** | $p$ and $q$ are both false or both true | $not xor$ |
|
||||
|
||||
Reference in New Issue
Block a user