Kozdęba, Agnieszka and Tyszka, Apoloniusz (2022) Theorems and open problems that concern decidable sets X⊆N and cannot be formulated in the formal language of classical mathematics as they refer to the current knowledge on X. [Preprint]
 | There is a more recent version of this item available. |
|
Text
ak_at.pdf Download (234kB) | Preview |
Abstract
Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. We present a new heuristic argument for the infiniteness of P(n^2+1). Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,(((24!)!)!)!]. Let B denote the system of equations: {x_i!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. We write some system U⊆B of 9 equations which has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. We write some system A⊆B of 8 equations. Let Λ denote the statement: if the system A has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). Algorithms always terminate. The next theorems and open problems justify the title of the article and involve epistemic and informal notions. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies the conjunction of Conditions (1)-(5) for X=P(n^2+1). We define a set X⊆N which satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption.
| Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
| Social Networking: |
| Item Type: | Preprint | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Creators: |
|
|||||||||
| Keywords: | algorithms whose existence is provable in ZFC, conjecturally infinite sets X⊆N, constructively defined integer n satisfies card(X)<ω ⇒ X⊆(-∞,n], current knowledge on a set X⊆N, known elements of a set X⊆N whose infiniteness is false or unproven, mathematical definitions, theorems and open problems with epistemic and informal notions, physical limits of computation, primes of the form n^2+1, X is decidable by a constructively defined algorithm which is currently known | |||||||||
| Subjects: | Specific Sciences > Mathematics > Foundations Specific Sciences > Mathematics > Logic Specific Sciences > Computation/Information |
|||||||||
| Depositing User: | Apoloniusz Tyszka | |||||||||
| Date Deposited: | 06 Mar 2022 20:25 | |||||||||
| Last Modified: | 06 Mar 2022 20:25 | |||||||||
| Item ID: | 20239 | |||||||||
| Subjects: | Specific Sciences > Mathematics > Foundations Specific Sciences > Mathematics > Logic Specific Sciences > Computation/Information |
|||||||||
| Date: | 3 January 2022 | |||||||||
| URI: | https://philsci-archive.pitt.edu/id/eprint/20239 |
Available Versions of this Item
-
The distinction between existing algorithms and constructively defined algorithms inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X. (deposited 28 Nov 2021 20:17)
-
The distinction between existing algorithms and constructively defined algorithms inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X. (deposited 10 Dec 2021 17:42)
-
The distinction between existing algorithms and constructively defined algorithms inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X. (deposited 04 Jan 2022 23:45)
- Theorems and open problems that concern decidable sets X⊆N and cannot be formulated in the formal language of classical mathematics as they refer to the current knowledge on X. (deposited 06 Mar 2022 20:25) [Currently Displayed]
-
The distinction between existing algorithms and constructively defined algorithms inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X. (deposited 04 Jan 2022 23:45)
-
The distinction between existing algorithms and constructively defined algorithms inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X. (deposited 10 Dec 2021 17:42)
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
 |
View Item |
![[feed]](http://philsci-archive.pitt.edu/style/images/feed-icon-32x32.png){kind=icon}