The strength of replacement in weak arithmetic

Simple item page
dc.creatorCook, Stephen
dc.creatorThapen, Neil
dc.date2004-09-08
dc.date.accessioned2026-07-07T03:21:46Z
dc.date.available2026-07-07T03:21:46Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/cs/0409015
dc.identifierhttp://arxiv.org/abs/cs/0409015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32328
dc.subjectLogic in Computer Science
dc.subjectComputational Complexity
dc.titleThe strength of replacement in weak arithmetic
dc.typetext

Files

Collections

arXiv