If there are not, then would it be easier to say that 2 objects are identical as ordered fields as opposed to being isomorphic as ordered fields? Or is the word isomorphism used to emphasise the fact that the objects are different as sets?

Inside of the complex numbers there are lots of examples of distinct fields which are isomorphic. For instance, there are three subfields of the form ${\mathbf Q}(\alpha)$ where $\alpha^3 = 2$: take for $\alpha$ any of the three complex cube roots of 2 and you get a different subfield. What are the consequences of treating them as literally equal? You can't make any sense of Galois theory if you do that! Similarly, all $p$Sylow subgroups of a finite group are isomorphic (since conjugate subgroups are isomorphic groups), but it would kind of destroy a lot of the content of the Sylow theorems by trying to say the $p$Sylow subgroups are identical. More generally, anytime you have isomorphic but unequal objects inside a larger object, it can lead to confusion if not outright incomprehensibility if you try to regard them all as identical. (There was a paper by Chevalley about unit groups in number fields where he made a genuine error by an abuse of the "square root" notation and I think one might be able to express the mistake in the form of an isomorphism being confused with an equality, but I'd have to look at the paper again to be sure about this.) The word isomorphism does not emphasize that two objects are different; any group or vector space admits an isomorphism with itself using the identity map. The word emphasizes that in a structural way the two objects look like each other even though they are not literally the same. Never say two objects are identical if they are not actually identical. Having said that, I must admit that in mathematics one meets phrases like "since $X$ and $Y$ are isomorphic we can identify $X$ with $Y$" and then $X$ is replaced with $Y$. The usefulness of doing this depends on the application you have in mind. Note, however, that replacing $X$ with $Y$ is not saying that $X$ and $Y$ are the same thing. This question sounds like it is being asked by someone who hasn't had a lot of experience with isomorphisms and is trying to get a feel for what it means. In a year or two, after seeing more appearances of the concept and its uses, you'll get a better feel for it, but for now do not think the word isomorphism is a synonym for identical. 


A slightly more general answer: if the objects in question have no nontrivial automorphisms (i.e. nonidentity isomorphisms from itself to itself) then no danger will come from treating isomorphisms as the identity. (E.g. the real numbers has no automorphisms as a field, and so any two copies of the real numbers can be unambiguously identified as fields.) But if $X$ and $Y$ are isomorphic but Aut($Y$) (or, equivalently, Aut($X$)) is nontrivial, then the identification of $X$ and $Y$ is not uniquely determined (because you could always postcompose with a nontrivial automorphism of $Y$, or precompose with a nontrivial automorphism of $X$, to obtain a different identification), and hence in this case there is not an unambiguous identification. (A typical example of this is the isomorphism between a finitedim'l vector space and its dual; there is not a uniquely determined such isomorphism, and so one should not identify the two, although they are isomorphic.) In some contexts, although there is not a uniquely determined isomorphism, there is a canonical choice, e.g. the identification of a finite dimensional space with its double dual. Such isomorphisms are normally described in the language of natural isomorphisms between functors (e.g. the identify functor and the double duality functor are naturally isomorphic as functors from the category of finitedimensional vector spaces  over some given field  to itself.) Often it is safe to identify objects that are identified by a natural isomorphism in some category theoretic framework that is suitable for the problem at hand. But even in these cases, sometimes one has to actually know an explicit description of the natural isomorphism (e.g. because you might need to make a computation involving both objects, which will of course require you to know how they have been identified). In particular, when identifying two objects via some natural isomorphism, it is good form to explicitly describe the natural isomorphism at some point, unless the natural isomorphism in question is utterly conventional (e.g. the double duality isomorphism for a finitedimensional vector space; and even then, one might write something like "we identify $V$ and $V^{\vee\vee}$ via the usual double duality isomorphism"). Added: This answer is very similar to that of Charles Staats, which was posted while I was writing. 


If $p$ is a prime, then the multiplicative group modulo $p$ is isomorphic to the additive group modulo $p1$, which is to say it's a cyclic group of order $p1$. It's trivial to find a generator of the additive group, but a fair bit of work to find one for the multiplicative. Related to this, it's easy to solve $ax=c$ in the additive group, using the Euclidean algorithm, but the difficulty of solving the corresponding equation $a^x=c$ in the multiplicative group  the discrete logarithm problem  is the basis for some cryptography systems. 


First of all, as other posters have said, you never claim that two objects are identical unless they actually are equal as sets. However, there are times when it is appropriate to "identify" two isomorphic objects. (This is really just an issue of language). Exactly when such identification is appropriate is a matter of some subtlety. If there are many different isomorphisms between two objects, and no natural way of selecting one of them, then it is generally a bad idea to identify them (although sometimes this is done implicitly, as when we talk about the field with $q$ elements). This applies in particular to a vector space and its dual. Generally speaking, if you have a unique isomorphism, or even a "natural isomorphism" (this can be made precise using category theory if desired), you are safe identifying them; however, this might conceivably produce problems if they are distinct subsets of some larger set you are interested in. To further complicate the matter, in many, or even most, cases, we don't actually care about the identity of the set in question, only its (external or internal) structure. Thus, for instance, any questions about the real numbers that cannot be answered using the fact that they form a complete ordered field (e.g., is $1 \in 2$?) are not really questions about the real numbers at all. This produces interesting issues in philosophy of mathematics; see this website for a discussion. Things get even more interesting when you start defining objects (e.g., tensor products, limits, colimits) using universal properties; in this case, the objects are only defined up to natural isomorphism, so there is no single construction that "is" the desired object. There are also times when either of two identifications may be appropriate, but not both at once. For instance, $\mathbb{Z}$ is naturally isomorphic to a fixed subset of the padic numbers $\mathbb{Z}_p$, and to a fixed subset of the real numbers $\mathbb{R}$, but no one would ever write $\mathbb{Z} \subset \mathbb{Z}_p \cap \mathbb{R}$ (except to discuss when it is not appropriate to make identifications). In short, it's a subtle question, and the answer is based more on experience than on any codified set of principles. 


Expanding on Andy Putman's comment, beginners in linear algebra often think of all finitedimensional vector spaces (over $\mathbb{R}$, say) as the same, in particular as $\mathbb{R}^n$ with the standard basis. This can lead to mistakes in any kind of computation, say in multivariable calculus, where one has to compute simultaneously with a row vector and a column vector (e.g. an element of a vector space together with an element of its dual). The problem is that matrices act differently on row and column vectors, hence if you end up changing basis you need to deal with row and column vectors in opposite ways. 


One paper I looked at needed to check every subgroup of $S_n$ for small $n$. There's a lot of symmetry there, which the author was trying to exploit. Although $S_4$ contains three subgroups isomorphic to $\mathbb{Z}_2\times\mathbb{Z}_2$, the author only checked one of them; without loss of generality (``by symmetry'') that was sufficient. Problem is, one of those subgroups is normal and the other two are not, and that could have made a difference. The punchline is that the additional case checked out finethe logical error didn't snowball. 


The answers are great so far, especially Emerton's. I would like just to add another example which I have encountered. It is the gluing construction of the structure sheaf of an affine scheme. I think the one given by "locally constant elements in the stalks" is better, but anway: If $A$ is a ring and $X=Spec(A)$ its spectrum, then it can be shown that the assignment $\mathcal{O}_X(D(f)) := A_f$ is a sheaf on the basic open subsets. Now every sheaf on a basis of a topological space (which is closed under intersections) extends uniquely to a sheaf on the whole topological space. But wait, if $D(f)=D(g)$, it is not necessarily true that $A_f = A_g$! But we can fix that by observing that there is a unique $A$algebra homomorphism $A_f \to A_g$ if $D(g) \subseteq D(f)$, and that this is actually an isomorphism if $D(f) = D(g)$. Thus in practice it really does not matter which $g$ with $D(f)=D(g)$ is chosen. There are some ways of formalizing this. For example you could define $Q$ to be a big ring which contains all the $A_f$ as subrings, but the identifications become identities. Define a partial order on $A$ by $f \leq g \Leftrightarrow D(g) = D(f)$. Then $A_f$ is a direct system on this partial order and we can take $Q$ as its colimit. 


In Group Theory there is a notion stronger than isomorphism, i.e. similarity. For two permutation groups to be "similar" there must exist both an isomorphism between the group and a compatible (commuting in the categorical sense) isomorphism between the sets being permuted. The couple of these two isomorphisms is called a similarity. Two permutation groups can be isomorphic but not similar. Similarity is useful to compare group constructions such as the wreath product, group presentations and classifications of subgroups of the symmetric groups. In these situations, using only isomorphism would be a mistake and would lose information. 


Spivak, Differential Geometry, Vol. 1, Chapter 3, page 16. Background: $M$ is a manifold, $i$ is an embedding pf $M$ into a Euclidean space, and $T(M,i)$ is the tangent bundle on $M$, constructed assuming the existence of the immersion $i$, which is the way Spivak does carries out the construction at first. Then he notes that for a different choice $j$ of the immersion, we have a bundle equivalence between $T(M,i)$ and $T(M,j)$. Then goes on(quoted verbatim):
And then he constructs the tangent bundle in the way independent of the immersion, ie the more modern approach, and expounds its merits. 

