It is not the case that Most of Friedman's independence results require non-standard graph/tree encodings; truly 'simple' arithmetic statements remain PA-provable.
?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.