Cardinal number subtraction We all know that $|\mathbb{N}| = \aleph_0$. Since $|\{-1\} \cup \mathbb{N}| = \aleph_0$ as well, I guess you could say that $\aleph_0 + 1 = \aleph_0$.
You can go on to derive that $\aleph_0 + \aleph_0 = \aleph_0$, and by induction $n \times \aleph_0 = \aleph_0$ (assuming that $n$ is finite, anyway).
Now, here's a thing: What is $\aleph_0 - \aleph_0$?
Well, $|\mathbb{P}| = \aleph_0$, and $|\mathbb{P} \backslash \mathbb{N}| = \aleph_0$, so perhaps $\aleph_0 - \aleph_0 = \aleph_0$?
No, wait. Consider the set $S = \{n \in \mathbb{N}: n > 5\}$. Now we have $|S| = \aleph_0$, and yet $|\mathbb{N} \backslash S| = 5$. So maybe $\aleph_0 - \aleph_0 = 5$?
But that is absurd, since we can redefine $S$ to make the result any finite number we wish. Or we can define $S$ such that the result is countably infinite.
Does this mean that the notion of $\aleph_0 - \aleph_0$ simply has no definite answer? Or am I just being too simplistic here?

Assuming the axiom of choice, or at least that $\kappa$ and $\lambda$ are well ordered cardinals, if $\kappa<\lambda$ then $\lambda-\kappa=\lambda$. 
Any other case, as you noted, is not well defined. Without the axiom of choice the structure of cardinals can differ greatly between models and there might be limited examples for when it is well defined. 
The same can be said about division. Here we require that $\kappa<\mathrm{cf}(\lambda)$, and it is undefined otherwise. 
