It is not the case that Computational predicates like 'polynomial-time computable' depend on interpretation of primitive terms; formal consistency permits non-standard domains.
?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.