Godel's Scam Incompleteness Theorem

This can be considered an implicit addendum to the many great "scam indicator" lists.

Godel's Scammer Incompleteness Theorem
For any given list of scam indicators, a scam exists which is not covered by that list.

Formal proof:

1. Scam indicators can be considered as logical axioms. For instance, a scam indicator could be
"The stated identities of the project team do not exist."

2. For any given set (list) of scam indicators, there are a finite number of indicators on that list.

3. Functions within a scam indicator can be assigned natural numbers. For instance, "If identity is false, then it is a scam" If=1, identity=2, is=3, false=4, then=5, it=6, a scam=7.

4. These assigned number can be input into a "Godel Scam Number" which is the product of prime numbers that are each taken to the power of x where x is the next "assigned natural number." For instance, the Godel Scam Number in step 3 would be 2^1x3^2x5^4x7^5x11^6x13^7= 2.1018528e+22

5. No finite set contains all natural numbers.

6. Therefore, Godel scam numbers exist which will be outside of the scam set no matter how large that set is.

Conclusion: It is impossible to create a complete list of scams.

So don't get angry when something is left out.