Reversible and Irreversible Trees
Milo\v{s} S. Kurili\'c

TL;DR
This paper characterizes reversible trees, identifying conditions under which trees are non-reversible or reversible, and explores the existence of reversible trees across various types and cardinalities.
Contribution
It introduces a new characterization of reversibility in trees using critical nodes and archetypical subtrees, expanding understanding of tree structures.
Findings
Countable trees of height ω are reversible iff all nodes are finite.
Regular n-ary trees are reversible.
Existence of reversible Aronszajn, Suslin, and Kurepa trees.
Abstract
A tree is reversible iff there is no order such that . Using a characterization of reversibility via back and forth systems we detect a wide class of non-reversible trees: ``bad trees" (having all branches of height , where is a regular cardinal). Consequently, a countable tree of height and without maximal elements is reversible iff all its nodes are finite. We show that a tree is non-reversible iff it contains a ``critical node" or an ``archetypical subtree" (parts of with some combinatorial properties). In particular, a tree with finite nodes is reversible iff it does not contain archetypical subtrees. Using that characterization we prove that if for each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Rings, Modules, and Algebras
