In the present paper, we explore an idea of Harvey Friedman to obtain a coordinate-free presentation of consistency. For some range of theories, Friedman's idea delivers actual consistency statements (modulo provable equivalence). For a wider range, it delivers consistency-like statements. We say that a sentence C is an interpreter of a finitely axiomatised A over U iff it is the weakest statement C over U, with respect to U-provability, such that U+C interprets A. A theory U is Friedman-reflexive iff every finitely axiomatised A has an interpreter over U. Friedman shows that Peano Arithmetic, PA, is Friedman-reflexive. We study the question which theories are Friedman-reflexive. We show that a very weak theory, Peano Corto, is Friedman-ref...