 Rosser’s modification of the first theorem (Rosser 1936)  Let \(F\) be consistent formalized system which contains Q. Then there is a sentence \(R_F\) of the language of \(F\) such that neither \(R_F\) nor \(\neg R_F\) is provable in \(F\). 