Earlier quoted context omitted.
> A formal system cannot in general prove that it is reliable, i.e. that if it proves statement P then P is true This implies second order logic. It is not clear to me, whether the loss of consistency is warranted. Type Theories are tried to avoid inconsistence. However high the order of the processing logic is, its only reason to exist is to output first order theorems, those we can prove decidable. > But with this…
> This implies second order logic. No, it does not. The second incompleteness theorem is provable in first-order Peano Arithmetic. > Of course I'm in no position to say a similar thing about Goedels incompleteness theorem, and I even referred to it's result in higher order logics, but I still doubt the relevance, as many seem to be ignorant of his former completeness theorem. I have no idea what you're trying to say,…
> A formal system cannot in general prove that it is reliable
I hadn't noticed when I wrote that, formal system is an idiom - even more specific in this specific context. How confusing.