OurBigBook About$ Donate
 Sign in Sign up

Productivity of arithmetic truth

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Computability theory Productive set
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Uniformly diagonalize against the formula expressing membership in We​ to obtain a sentence saying that its own code is not in We​. If every enumerated sentence is true, this new sentence cannot be enumerated, and hence is true. Its code is a computable new element of arithmetic truth outside We​.

 Ancestors (6)

  1. Productive set
  2. Computability theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 25 / 6 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook