Positive-existential decoder criterion for rational pair storage
Statement
Question 14 (Cornelissen). Jeroen Demeyer has observed that the existence of a polynomial bijection N2 → N implies that any first order formula over N in positive prenex form is equivalent to one in which every block of consecutive universal quantifiers is replaced by just one (and the number of existential quantifiers goes up). Such a polynomial bijection can be found in Davis, Math. Monthly 80, 236-237. Does something similar work for Q, in other words, can we find a Diophantine injection
Q2 ↪→ Q? There are some observations related to this in C.R.A.S. Paris 328, 3-8 (1999); for example, this would follow from the generalized abc-conjecture.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.