Povzetek: We introduce and prove the basic properties of an encoding that generalizes to non-well-founded hereditarily finite sets the bijection defined by Ackermann between hereditarily finite sets and natural numbers. The new encoding maps its domain onto dyadic rational numbers.

 

You can download slides from the lecture here: DOWNLOAD