Well-Ordering Hereditarily Finite Sets

  • Context: Graduate 
  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Finite Sets
Click For Summary
SUMMARY

The discussion confirms the existence of a recursive well-ordering of hereditarily finite sets. It explains that at each construction step, only a finite number of sets are added, which can be ordered lexicographically. The natural well-order is exemplified as ({}, {{}}, {{{}}}, {{}, {{}}}, ...). This establishes a clear method for organizing these sets recursively.

PREREQUISITES
  • Understanding of recursive functions
  • Familiarity with well-ordering principles
  • Knowledge of set theory, specifically hereditarily finite sets
  • Basic concepts of lexicographic ordering
NEXT STEPS
  • Research recursive well-ordering techniques in set theory
  • Study the properties of hereditarily finite sets
  • Explore lexicographic ordering in mathematical contexts
  • Investigate applications of well-ordering in theoretical computer science
USEFUL FOR

Mathematicians, computer scientists, and students of set theory interested in advanced topics related to well-ordering and finite sets.

Dragonfall
Messages
1,023
Reaction score
5
Does there exist a recursive well-ordering of the hereditarily finite sets?
 
Physics news on Phys.org
Sure. At each step in the construction, only a finite number of sets are added; these can be ordered as desired (lexiographically, say).

The natural well-order is then ({}, {{}}, {{{}}}, {{}, {{}}}, ...)
 
Excellent. Thanks.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
466
  • · Replies 1 ·
Replies
1
Views
550
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K