It is not the case that Friedman's TREE(3) and related functions provably exceed PA's proof-theoretic strength, demonstrating genuine independence of simple combinatorial statements.
?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.