Here is a private question to the paper The Finitist Completeness Theorem (FCT): No Gödel's Uncertainties by Ed Gerck at ResearchGate.
The paper presents a rigorously motivated departure from the traditional framework of mathematical logic. It claims that Gödel’s incompleteness theorems, long considered insurmountable limitations on formal systems, are not intrinsic to logic but instead emerge from the assumption of infinite domains.
Gerck proposes that when logic is restricted to explicitly bounded, finite domains of arbitrary-length integers (up to a fixed N), the resulting system becomes complete, consistent, and decidable -- Distinguished in the DAOF method cited.
The author's invitation to feedback is welcomed, and this response aims to contribute constructively to that dialogue.
What is your qualified opinion?