We introduce F-structures and investigate interpretations of trees in
F-structures. Thus trees are viewed as schemes of computations in F-st
ructures. Every tree is shown to be strongly equivalent to some chain-
free tree. This enables us to use the grammatical codings of [2] to de
fine formulas for arbitrary interpreted trees. We also introduce a syn
tactic way to compute the values of interpreted trees.