Can you have negative sets? I figure that since you can, of course, have members in a set, have only a single member in a set, and then have no members in a set, it seems not then a big step forward (or backwards depending how you think of it) to think of a set with negative members.
I shall elucidate. Since set theory deals with membership, and it deals not with the quantity, but the quality of those members, perhaps it be possible to have a set with negative members which subtract members from another set whose positive counterparts is contained therein.
For example, the union of the sets $A$ and $B$, where set $A = \{1,2,3\}$ and set $B =\{-3\}$ would result in the set $A ∪ B = {1,2}$.
Two notes: First, you can arbitrarily construct any set one desires, but when applied to the real world, perhaps this may be of use?; Second, the empty set seems frivolous but turned out to be quite useful, maybe the same may be said for negative sets?
As someone pointed out, and they are of course correct, the set would actually be $\{1,2,3,-3\}$. However, in sticking with the principle, is what am describing denotable?
 A: There is a generalization of multisets that may be what you want, which I shall call countsets but is actually nothing more than a set of pairs such that the first member of the pairs is unique and the second member of each pair is a non-zero integer. The reason I describe it this way instead of as a function from the universe (whole domain of discourse) to the integers is that in ZFC there is no function because every function has domain being a set, and there is no universal set.
$
\def\none{\varnothing}
\def\wi{\subseteq}
\def\zz{\mathbb{Z}}
$
More precisely, a set $S$ is a countset iff ( $S \wi U \times \zz_{\ne 0}$ for some set $U$ and ( for each $x \in U$ there is a unique $y \in \zz_{\ne 0}$ such that $(x,y) \in S$ ) ).
For convenience let $base(S) = \{ x : (x,y) \in S \}$ and $count(S,x) = \cases{ 0 & if $x \notin base(S)$ \\ y & if $(x,y) \in S$ for some $y$ }$.
We can then define operations on countsets $S,T$ as follows:


*

*$S \cap T = \{ (x,m) : x \in base(S) \cup base(T) \land m = \min(count(S,x),count(T,x)) \land m \ne 0 \}$.

*$S \cup T = \{ (x,m) : x \in base(S) \cup base(T) \land m = \max(count(S,x),count(T,x)) \land m \ne 0 \}$.

*$S + T = \{ (x,m) : x \in base(S) \cup base(T) \land m = count(S,x)+count(T,x) \land m \ne 0 \}$.

*$S - T = \{ (x,m) : x \in base(S) \cup base(T) \land m = count(S,x)-count(T,x) \land m \ne 0 \}$.

*$-S = \none - S$.
These satisfy the properties:


*

*Normal sets embed into countsets via $S \mapsto \{ (x,1) : x \in S \}$.  [So countsets extend normal sets.]

*$\cap,\cup,+$ are commutative and associative on countsets.

*$\cap,\cup$ are idempotent on countsets (when applied to identical countsets gives the same result).

*$\none$ is the identity for $+$ on countsets; namely $S + \none = S$ for any countset $S$.

*$-$ is the inverse operation for $+$; namely $S + (-S) = \none$ for any countset $S$.

*Countsets obey extensionality; namely $S = T$ iff $count(S,x) = count(T,x)$ for every $x \in base(S) \cup base(T)$.  [The restriction of non-zero count is precisely to achieve this property, because it ensures that there is a unique representation of each countset.]
In particular we get what you want because:

$\{(1,1),(2,1),(3,1)\} + \{(3,-1)\} = \{(1,1),(2,1)\}$.

In short, we can use non-zero integer tags for each item, instead of thinking of them as negative items, and all this can be defined and manipulated in any reasonable set theory.
A: This is an interesting question. 
Clearly you have no problem with a set that contains some negative numbers, like the $B$ in your question. You're asking instead about something like a set with a negative number of elements. 
That's not possible with the usual meaning of "set" so to get such "sets" you would have to invent an extension of that meaning. That kind of invention in mathematics has happened before. The numbers $1, 2, \ldots$ are good for counting. That system was usefully extended to include $0$ and the negative integers, even though it's a stretch to think of those as good for counting.
As for sets: yes the empty set turns out to be very useful. You'd want to invent "negative sets" if you stumbled across a problem where the idea would help you to a solution. The problem you started with doesn't seem to need such an invention, since ordinary sets containing negative numbers do the job when combined with a new operation on sets that creates a new set by forming a union and "cancelling" when a number and its negative match. 
A: I think the best way to think of this is to first define the concept of a negative set as follows:  For any set $B$ we define the negative set $-B$, which supports the operations of union with any set $A\supseteq B$ (defined as $A\cup -B=A\setminus B$) or any other negative set (defined $-A\cup -B=-(A\cup B)$), and intersection with negative sets (defined as $-A\cap -B=-(A\cap B)$).
Once we have this definition, we can extend it to include the idea of "mixed sets" which we define as $[A\cup -B]$ for two disjoint sets $A$ and $B$.  Then union of two mixed sets can be defined as $[A\cup -B] \cup [C\cup -D]= [((A\cup C)\setminus (B\cup D))\cup -((B\cup D)\setminus(A \cup C))]$ with intersection and complementation defined similarly.  
Sets with negative elements thus correspond to ordered pairs of disjoint sets.  Extending the notion of sets in this way is to me reminiscent of extending real numbers to complex numbers, as these new sets are a combination of a standard set and a new sort of object derived from a second standard set, just as a complex number is a real number combined with an imaginary number (which is derived from another real number through multiplication by $i$).
A: The '$-$' sign you define introduces a 'count' for any element, which can be present positively, absent, or present negatively. However, the operations that you would then use are the arithmetic operations plus and minus, which need the count to be over the set of integers, not just $\{-1,0,1\}$ : this is the multiplicity idea of the multisets.
In order to have such a concept, you first need to have a set of operations operating on $\{-1,0,1\}$ as the AND/OR operators are on $\{0,1\}$, or as plus and minus are on integers.
A: If you seek a generalization of multisets where elements can have negative membership count (signed multisets) then this has been investigated many times in the past. One place to start learning about the history is Wayne D. Blizard's paper Negative Membership, which cites prior work by T. Hailperin, M. Kline, E. Fischbein, H, Whitney, R. Rado, M. P. Schutzenberger, S. Eilenberg, R Feynman and others.
See also Blizard's The Development of Multiset Theory and also this prior question.
A: This is possible. Essentially you want to extend the definition of a multiset to also include negative numbers as multiplicities. But I don't know if there is any useful application of this.
A: What you describe is isomorphic (using this word loosely) an operation (in the normal sense) of the class of all functions $f:\; S \mapsto \{-1,0,1\}$. 
For example, if $f(a) =m$, then the set $f$ has $m$ copies of element $a$. 
Call $$
\mathcal{L} := \big\{ f: S \mapsto \{-1,0,1\} \big\}
$$
Then union becomes "addition and truncate to 1". I.e.,
$$
\cup : \mathcal{L} \times \mathcal{L} \mapsto \mathcal{L}  \\\\
(f \cup g)(a) := 
\begin{cases}
1,\; f(a)+g(a) \geq 1 \\\\
-1,\; f(a)+g(a) \leq -1 \\\\
0,\; \textrm{otherwise}
\end{cases},\; a \in S.
$$
However, this doesn't preserve the property $f \cup (g \cup h) = (f \cup g) \cup h$. 
So I have another suggestion. Allow set elements be repetitive, even negative copies. Then, $$
\mathcal{L} := \big\{ f: S \mapsto \mathbb{Z} \big\}
$$
Then simply define union to be addition:
$$
\cup : \mathcal{L} \times \mathcal{L} \mapsto \mathcal{L}  \\\\
(f \cup g)(a) := f(a)+g(a),\; a \in S.
$$
I don't know how to define intersection, though. 
Maybe an intersection of sets is
$$
\cap : \mathcal{L} \times \mathcal{L} \mapsto \mathcal{L}  \\\\
(f \cap g)(a) := f(a) g(a),\; a \in S.
$$
So I have preserved
$$
f \cap g = g \cap f \\\\
f \cup g = g \cup f \\\\
(f \cup g) \cap h =(f \cap h) \cup (g \cap h)
$$
Unfortunately, I did not preserve
$$
(f \cap g) \cup h =(f \cup h) \cap (g \cup h)
$$
The traditional count of element is the number of element truncated by one. If $f*$ be traditional count of $f$, then 
$$
f*(a) =\begin{cases}
f(a),\; f(a)=-1,0,1 \\\\
1,\; f(a) >1 \\\\
-1,\; f(a) <-1
\end{cases}
$$
