An alternative proof of Godel's first incompleteness theorem

Abstract

This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.

arXiv comment5 pages, typos corrected, lemmas added, more uniform notation, clarifying notes added, the proof is essentially the same