Jump to content

Talk:Elementary function arithmetic

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yahya Abdal-Aziz (talk | contribs) at 13:24, 5 November 2017 (Example needed of a true but unprovable artificial arithmetic statement: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Example needed of a true but unprovable artificial arithmetic statement

In 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! –

  1. exactly what is intended by the epithet "artificial" in the context of "arithmetical statements"; or
  2. 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)[reply]