Constructive mathematics with the knowledge predicate K satisfied by every currently known theorem

arXiv1309.2605MaRDI QIDQ6507433FDOQ6507433

Authors: Apoloniusz Tyszka Error creating thumbnail:

Abstract: Edmund Landau's conjecture states that the set $P(n^2+1)$ of primes of the form $n^2+1$ is infinite. Landau's conjecture implies the following unproven statement $Phi$: $card(P(n^2+1)<omegaRightarrowP(n^2+1)subseteq[2,(((24!)!)!)!]$. We heuristically justify the statement $Phi$. This justification does not yield the finiteness/infiniteness of $P(n^2+1)$. We present a new heuristic argument for the infiniteness of $P(n^2+1)$, which is not based on the statement $Phi$. The distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known inspires statements and open problems on decidable sets $mathcalXsubseteqmathbbN$ that contain informal notions and refer to the current mathematical knowledge on $mathcalX$.

Mathematics Subject Classification ID

Other constructive mathematics (03F65)

This page was built for publication: Constructive mathematics with the knowledge predicate $K$ satisfied by every currently known theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507433)