✦ LIBER ✦
Bijections between formulae and trees which are compatible with equivalences of the type ((ƒ·g)·h)∼((ƒ·h)·g)
✍ Scribed by R.P. Nederpelt
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 376 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We describe a bijection which maps trivalent ordered trees, representing certain formulae, onto ordered trees. The mapping is such that an equivalence relation of the type ((f o g) o h) ((f o h)o g) on the set of formulae, induces the equivalence relation of being equal modulo order on the set of ordered trees.