It is not the case that Second-order logic without finiteness restriction can express properties (like well-foundedness) unprovable in any recursively enumerable system.
?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.