The strength of replacement in weak arithmetic
计算机科学中的逻辑
2007-05-23 v1 计算复杂性
摘要
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.
引用
@article{arxiv.cs/0409015,
title = {The strength of replacement in weak arithmetic},
author = {Stephen Cook and Neil Thapen},
journal= {arXiv preprint arXiv:cs/0409015},
year = {2007}
}