A tree in set theory is a partial order  such that the set of predecessors of each element  is well-ordered. We introduce the notion of history tree and give a sufficient condition for the existence of an isomorphism between a tree and its history tree.

tree in set theory, ideal in partial order.

Received: August 2, 2022; Accepted: September 10, 2022; Published: September 27, 2022

How to cite this article: Yonah Cherniavsky and Adi Jarden, On the history tree, Advances and Applications in Discrete Mathematics 34 (2022), 17-21. http://dx.doi.org/10.17654/0974165822040

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] Thomas Jech, Set Theory, Springer-Verlag, Berlin Heidelberg, 2003.
[2] Kenneth Kunen, Set theory, An Introduction to Independence Proofs, Studies in Logic and the Foundations of Mathematics, Amsterdam, New York, Oxford, Vol. 102, 1980.
[3] Assaf Rinot, Antichains in partially ordered sets of singular confinality, Arch. Math. Logic 46(5-6) (2007), 457-464.