2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32328The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, sometimes under a complexity assumption.Logic in Computer ScienceComputational ComplexityThe strength of replacement in weak arithmetictext