The strength of replacement in weak arithmetic
classification
💻 cs.LO
cs.CC
keywords
arithmeticreplacementschemeweakassertsassumptionaxiombounded
read the original abstract
The 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.