It is primarily a matter of convenience that fields (and sometimes domains) are required by definition to satisfy $1\ne 0,\,$ i.e. the trivial ring $\{0\}$ is excluded. There are various motivations for such. Without this convention many definitions and theorems would require cumbersome exceptions to handle trivial degenerate cases. Also in domains and fields it often proves very convenient to assume that one has a nonzero element available. This permits proofs by contradiction to conclude by deducing $\,1 = 0,\,$ or that $\,0\,$ is invertible, or equivalent field "absurdities". More importantly, it implies that the unit group of a domain is nonempty, so unit groups always exist. It would be very inconvenient to have to always add the proviso (except if $\;\rm R = 0)$ to the ubiquitous arguments involving units and unit groups. More generally it is worth emphasizing that the usual rules for equational logic are not complete for empty structures. That is why groups and other algebraic structures are always axiomatized to prevent nonempty structures (see this sci.math thread for further details).
Remark $ $ Perhaps worth mention is that there are some examples on MSE of just how confusing things can get if one starts reasoning in the zero ring, esp. in a proof by contradiction. For one example of such, see the long discussion in comments to my answer here, where it took a surprisingly long time to convince some readers that a reinterpretation of one of Rudin's proofs (by contradiction) was actually valid, and had a natural interpretation in the trivial ring (where $0/0 = 1$). See also the closely related discussion in this comment thread. If those discussions aren't enought to convince one of the pedagogical difficulties with such, then I suspect nothing will! $ $ Note: when reading those threads, be sure to click on "show more comments" so you can read the entire discussion (the top voted comments are skewed by the misunderstandings in the earlier part of the discussions).
Below is from my sci.math post of Sep 26, 1196.
Whether structures with empty carriers are allowed or not
depends on how one defines the notion of structure. Much
recent work in computational logic and algebra depends on
allowing empty carriers (uninhabited sorts), especially in
the many-sorted case. Below is a sample of related literature.
Manca, Vincenzo (I-PISA-IF); Salibra, Antonino (I-PISA-IF)
Soundness and completeness of the Birkhoff equational calculus
for many-sorted algebras with possibly empty carrier sets.
Theoret. Comput. Sci. 94 (1992), no. 1, 101--124.
MR 93f:03018 03B70 03C05 08B05 68Q65
Mahr, Bernd (D-TUB-I)
Empty carriers: the categorical burden on logic.
Categorical methods in computer science (Berlin, 1988), 50--65,
Lecture Notes in Comput. Sci., 393, Springer, Berlin, 1989.
MR 91f:03059 03C07 03B70 03G30 68Q55
Amer, Mohamed A. (ET-CAIRS)
First order logic with empty structures.
Studia Logica 48 (1989), no. 2, 169--177.
MR 91a:03013 03B10
Markusz, Zsuzsanna (3-CALG-C)
Different validity concepts in many-sorted logic.
Tanulmanyok---MTA Szamitastech. Automat. Kutato Int. Budapest
No. 192 (1986), 5--49.
MR 88i:03019 03B10 03C20
Meseguer, Jose (1-SRI-C); Goguen, Joseph A. (1-SRI-C)
Initiality, induction, and computability.
Algebraic methods in semantics (Fontainebleau, 1982), 459--541,
Cambridge Univ. Press, Cambridge-New York, 1985.
MR 88a:68073 68Q55 03B70 03D45 03D80 08A99
Mitchell, John C. (1-STF-C); Moggi, Eugenio (4-EDIN-C)
Kripke-style models for typed lambda calculus.
Second Annual IEEE Symposium on Logic in Computer Science (Ithaca, NY, 1987).
Ann. Pure Appl. Logic 51 (1991), no. 1-2, 99--124.
MR 92a:03017 03B40 03G30 68Q55