We show how binary correspondences can be used for simple formalization of the notion of problem, definition of the basic components of problems, their properties, and constructions. In particular, formalization of the following notions is presented: condition, data, unknowns, and solutions of a problem, solvability and unique solvability, inverse problem, composition and restriction of problems, isomorphism between problems. We also consider topological problems and the related notions of stability and correctness. A connection is indicated between the stability and continuity of a uniquely solvable topological problem. The definition of parametrized set is given. The notions are introduced of parametrized problem, the problem of reconstruction of an object by the values of parameters, as well as the notions of locally free set of parameters and stability with respect to a set of parameters. As an illustration, we consider a singularly perturbed system of ordinary differential equations which describe a process in chemical kinetics and burning. Direct and inverse problems are stated for such a system. We extend the class of problems under study by considering polynomials of arbitrary degree as the right-hand sides of the differential equations. It is shown how the inverse problem of chemical kinetics can be corrected and made more practical by means of the composition with a simple auxiliary problem which represents the relation between functions and finite sets of numerical characteristics being measured. For the corrected inverse problem, formulas for the solution are presented and the conditions of unique solvability are indicated. Within the study of solvability, a criterion is established for linear independence of functions in terms of finite sets of their values. With the help of the criterion, realizability is clarified of the condition for unique solvability of the inverse problem of chemical kinetics.