Oracle-Tree Forcing and Wilfs Inequality for Thirteen Left Elements

Abstract

We study filter-Laver forcing on omegaxomega with successor sets containing final quadrants. The observation retaining the minimum coordinate and orientation is a complete projection. Its finite nontrivial hidden-label quotients are Cohen, whereas the full offset quotient has Boolean density equal to the ground-model dominating number dV . For the associated grid-meager ideal I_box, we prove cov(I_box) = add(M) for the usual meager ideal M, and obtain further cardinal bounds. We also analyze threshold games, oracle degrees and the distinction between positive and filter-large certificate sets: recurrent filter-large acceptance admits refinements whose every branch succeeds. As an arithmetic application, we prove Wilfs inequality c \leq 13e for numerical semigroups with thirteen elements below the conductor c, where eis the embedding dimension. A complete arithmetic proof, including a bounded exact computation, is given in the appendix. Its terminating certificate procedures supply a computable quadrant tree and uniform refinements for every forcing condition. Finite support kernels describe persistence of the registered proofs; arithmetic absoluteness explains precisely why forcing organizes these certificates without replacing their arithmetic justification.