SWhat is claimed?
The manuscript claims that no algorithm can decide, for an integer-coefficient polynomial whose number of variables is part of the input, whether it has a rational zero. Rational numbers permit fractions, so this is a different decision problem from the classical integer result. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.
Scientific scope
It does not assert that any given equation is unsolvable, nor that restricted classes cannot have algorithms. The already known integer undecidability theorem cannot simply be relabelled as the rational result. WRS has inspected the cited statement and source-reported formalization scope where available; it has not audited the full proof or replayed Lean.
Evidence state
The source reports this result. WRS has not independently reconstructed the complete argument or validated the reported evidence. The grade and score here express conditional significance; they do not certify correctness. The provisional value enters the main reference rankings with an unverified label, but not achieved-science progress totals.
Full scientific record · Challenge or correct this assessment