TY - JOUR

T1 - Bijections between formulae and trees which are compatible with equivalences of the type $((f \circ g) \circ h) \sim ((f \circ h) \circ g)$

AU - Nederpelt, R.P.

PY - 1986

Y1 - 1986

N2 - 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 ((ƒ·g)·h)((ƒ·h)·g) on the set of formulae, induces the equivalence relation of being equal modulo order on the set of ordered trees.

AB - 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 ((ƒ·g)·h)((ƒ·h)·g) on the set of formulae, induces the equivalence relation of being equal modulo order on the set of ordered trees.

U2 - 10.1016/0012-365X(86)90073-7

DO - 10.1016/0012-365X(86)90073-7

M3 - Article

VL - 59

SP - 99

EP - 105

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-2

ER -