Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Joshua A. Grochow

TL;DR
This paper explores polynomial-time versions of the Axiom of Choice, establishing their equivalence to key complexity hypotheses and developing a theory of polynomial-time cardinality to connect set theory with computational complexity.
Contribution
It introduces polynomial-time formulations of AC, proves their equivalence to complexity hypotheses, and develops a polynomial-time cardinality theory extending previous unary-based work.
Findings
Many classical AC formulations are equivalent to known complexity hypotheses.
A new theory of polynomial-time cardinality is developed for larger alphabets.
Connections between AC, cardinality, and complexity questions are established.
Abstract
There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly inequivalent from a complexity-theoretic point of view. In this paper we show that many classical formulations of AC, when restricted to polynomial time in natural ways, are equivalent to standard complexity-theoretic hypotheses, including several that were of interest to Selman. This provides a unified view of these hypotheses, and we hope provides additional motivation for studying some of the lesser-known hypotheses that appear here. Additionally, because several classical forms of AC are formulated in terms of cardinals, we develop a theory of polynomial-time cardinality. Nerode & Remmel (Contemp. Math. 106, 1990 and Springer Lec. Notes Math.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Algebra and Logic
