In his proof of the first incompleteness theorem, Kurt Gödel provided a method of showing the truth of specific arithmetical statements on the condition that all the axioms of a certain formal theory of arithmetic are true. Furthermore, the statement whose truth is shown in this way cannot be proved in the theory in question. Thus it may seem that the relation of logical consequence is wider than the relation of derivability by a pre-defined set of rules. The aim of this paper is to explore under which assumptions the Gödelian statement can rightly be considered a logical consequence of the axioms of the theory in question. It is argued that this is the case only when the all the theorems of the theory in question are understood as statements of the same kind as statements of arithmetic and statements about provability in the theory, and only if the language of the theory contains logical expressions allowing to include certain predicates of meta-language in the language of the theory
