Set-Theoretic Axioms & Constructions

← Back to Domain-Specific Families

Abstractions about choice and maximality principles, symmetry axioms, transitive sets, coding, standard parts, and back-and-forth constructions.

7 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Axiom of countable choice — Assert that every countable family of nonempty sets admits a choice function, retaining a strictly weaker set-theoretic commitment than full Choice and a different strength from Dependent Choice.
• Back-and-Forth Method — A countable-structure isomorphism method that alternately extends finite partial isomorphisms to cover the next source and target elements, then unions the chain.
• Freiling's Axiom of Symmetry — Every assignment of a countable forbidden set to each real admits two reals that avoid one another's assigned sets—a set-theoretic principle equivalent over ZFC to the negation of the continuum hypothesis.
• Hausdorff Maximal Principle — The choice-equivalent principle that every chain in any partially ordered set extends to an inclusion-maximal chain.
• Set-Theoretic Code — A real coding a hereditarily countable set by a well-founded extensional relation on natural numbers whose Mostowski collapse recovers the set's transitive closure.
• Standard Part Function — Map each finite hyperreal to the unique real number infinitesimally close to it, thereby passing from a nonstandard approximation to its ordinary real shadow.
• Transitive Set — A set that contains every member of each of its members, equivalently a set T satisfying union(T) subseteq T.