>>12428729>>12428729>Second Incompleteness Theorem: "Assume F is a consistent formalized system which contains elementary arithmetic. Then " (Raatikainen 2015)Case 1) F is consistent, then we cannot prove consistency. Since F is consistent we cannot prove inconsistency.
Case 2) F is inconsistent, then we can prove both consistency and inconsistency?
So yes, you're right
