We establish primitive recursive (PR) versions of some known facts about computable ordered fields reals and reals, apply them to prove recursiveness several important problems in linear algebra analysis. One the central results this paper is a partial PR analogue Ershov–Madison’s theorem real closures fields. It allows us, particular, obtain root-finding algorithms algebraic with certain prope...