It is not the case that Gödel's incompleteness results show that arithmetical statements of low logical complexity can nonetheless be independent of PA, as demonstrated by Paris-Harrington.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.