Computer Science – Logic in Computer Science
Scientific paper
2004-09-08
Computer Science
Logic in Computer Science
Scientific paper
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.
Cook Stephen
Thapen Neil
No associations
LandOfFree
The strength of replacement in weak arithmetic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The strength of replacement in weak arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The strength of replacement in weak arithmetic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-343851