Beweis, daß jede Menge wohlgeordnet werden kann

Zermelo, E. (1904). Beweis, daß jede Menge wohlgeordnet werden kann. Mathematische Annalen, 59(4), 514-516.

Type

Journal article

Intellectual base

Primary research

Year

1904

Link

https://doi.org/10.1007/bf01445300matched

Cited from

mathematics

Cited by

2 citations across 2 artifacts.

Primes

• Order
  • established that every set can be well-ordered (modulo the axiom of choice)
• Well-Foundedness (Well-Ordering)
  • … there is no infinite descent, and the function is uniquely determined by its recursive equation); (3) minimal-counterexample method (to prove ∀x: P(x), assume a counterexample exists, take a ≺-minimal counterexample, derive a contradiction) — all three patterns rely on the same no-infinite-descent structure.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3d18f83aaa67 · see in the full table