There is more than one "Rosser's theorem" to wit: In number theory, Rosser's theorem states that the {\displaystyle n}th prime number is greater than log

There is more than one "Rosser's theorem" to wit: In number theory, Rosser's theorem states that the {\displaystyle n}th prime number is greater than log {\displaystyle n\log n}, where log{\displaystyle \log } is the natural logarithm function. It was published by J. Barkley Rosser in 1939. (wikipedia) Wiki refers to what Scott Aaronson is calling Rosser's theorem as "Rosser's trick" Rosser's trick uses a formula that says "If this sentence is provable, there is a shorter proof of its negation". Not that wiki is the cite beyond all reproach, having more than one theorem named after you is also a good thing.