On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

In a paper entitled "On computable numbers, with an application to the Entscheidungsproblem"* the author gave a proof of the insolubility of the Entscheidungsproblem of the "engere Funktionenkalkul". This proof contained some formal errors f which will be corrected here: there are also some other statements in the same paper which should be modified, although they are not actually false as they stand. is provable " is false (even with the new expression for Inst {q a S b S d Lq c }): we are unable for example to deduce F (~ n+1)-> (—F(u, u")\ and therefore can never use the term