The weak pigeonhole principle for function classes in S^1_2
Logic in Computer Science
2007-05-23 v1
Abstract
It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2 for provably weaker function classes.
Cite
@article{arxiv.cs/0608039,
title = {The weak pigeonhole principle for function classes in S^1_2},
author = {Norman Danner and Chris Pollett},
journal= {arXiv preprint arXiv:cs/0608039},
year = {2007}
}
Comments
11 pages