This paper examines the ontological commitments of the second-order language of arithmetic and argues that they do not extend beyond the first-order language. Then, building on an argument by George Boolos, we develop a Tarski-style definition of a truth predicate for the second-order language of arithmetic that does not involve the assignment of sets to second-order variables but rather uses the same class of assignments standardly used in a definition for the first-order language