Work

The convergence cost of non-monotone iteration: a linear certificate, an exponential critical point

Year: 2026
Type: preprint
Abstract: In the revision theory of Gupta and Belnap a finite theory of self-referential sentences induces a non-monotone operator whose orbits are iterated from arbitrary hypotheses. Hsiung isolated the stage at which periodic behaviour becomes unavoidable, the critical point, and recorded the two bounds in the literature: the pigeonhole bound 2^(n) for finite concurrent theories, and, by construction, entry stages of order 2^(n-1) with n sentences. Neither is a maximum, and no condition on a theory is known to yield a rate. In the dependency-skeleton framework we settle both. First, one structural condition --- closure of the evaluation operator, checkable in polynomial time and assuming neither monotonicity nor acyclicity --- forces every orbit to converge with critical point at most n, the number of sentences; inside this class the exponential regime collapses to a linear one, and the bound is attained. Second, the general bound is exact: for every n there is a skeleton with a unique fixed point in which every orbit converges and the critical point is exactly 2^(n)-1. The pigeonhole bound is thus the answer, and it is reached without paradox: attaining it costs dependence width, not paradoxicality. Third, that cost is not what buys exponentiality: under out-degree 2 the construction has no room to run --- at n=3 the maximum falls to 6<7 --- yet a companion construction still settles in 2^((n+1)/2) rounds, so width sets the exponent's constant, not its presence; the exact maximum there is open.
Language: English
Open Access status: green
OpenAlex ID: W7225919662
Cites:
Cited by:
Related to: 10