Tuples all the Way Down?

We can introduce singular terms for ordered pairs by means of an abstraction principle.1 Doing so proves useful for a number of projects in the philosophy of mathematics. However there is a question whether we can appeal to the abstraction principle in good faith, since a version of the Caesar Problem can be generated, posing the worry that abstraction fails to introduce expressions which refer determinately to the requisite sort of object. In this note I will pose the difficulty, and then propose a solution. Since my solution appeals to a plausible constraint on the introduction of new expressions to a language, it is of interest independently of the particular case of terms for pairs. Since these provide the occasion for discussion we should nonetheless review the use of abstraction for pairs before the argumentative business of the paper commences.