There are several axioms that are known to be independent of the usual ones; for instance, the Axiom of Choice. This axiom can be stated in several equivalent ways, e.g.:
- For every set $A$, $\mathcal{P}(A) \setminus \{\emptyset\}$ has a choice function.
- For every infinite set $A$, there is a bijective map between the sets $A$ and $A \times A$.
- Every surjective function has a right inverse.
- All sets have a cardinality, which has a strict total order.
There are several different fundamental axioms you can pick for a proof system. No matter what you pick, if your selection is powerful enough to be useful, you can derive the "axioms" that a different proof system uses from your axioms.
Given how axioms can be defined in terms of each other, and some sets of axioms are independent of others, it feels like you can describe the relationships between axioms using the language of graph theory, and from there you could explore minimal independent sets of axioms. I imagine there are certain properties that all sets of axioms share; I might have found one or two, but I have no idea how to go about investigating further.
I imagine somebody's already studied this, but I have no idea what they might have called it. What is known about this already?