ABSTRACT
The properties of codings for arithmetized languages having been establish ed, I now shall express the effect which recursiveness or recursive enumerability of an axiom system G have upon decidability and incompleteness. My approach still remains abstract in the sense the axiom systems G are only specified with respect to certain syntactical properties they can prove.
