It is not the case that Putnam's argument targets reference-fixing for general terms; 'polynomial-time computable' has clear extensional definition in standard models of arithmetic.
?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.