Abstract
We introduce and prove the basic properties of encodings that generalize to non-well-founded hereditarily finite sets the bijection defined by Ackermann in 1937 between hereditarily finite sets and natural numbers.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/