Talk:Elementary function arithmetic
(Redirected from Talk:Grand conjecture)
Latest comment: 7 years ago by Yahya Abdal-Aziz in topic Example needed of a true but unprovable artificial arithmetic statement
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
 | This article may be too technical for most readers to understand. (August 2011) |
Example needed of a true but unprovable artificial arithmetic statement
editIn the section "Friedman's grand conjecture", the following statement appears:
"… it is easy to construct artificial arithmetical statements that are true but not provable in EFA …"
However, it is not obvious – even to a mathematician! –
- exactly what is intended by the epithet "artificial" in the context of "arithmetical statements"; or
- that "it is easy to construct" such statements, especially when further restricted to being "true but not provable …".
So this assertion is crying out for an example of such an unprovable, true, artificial statement in EFA, and I have flagged it "example needed" (which links to the WP:AUDIENCE section, part of a supplement to the WP:Manual of Style). yoyo (talk) 13:24, 5 November 2017 (UTC)