Functional trees and automorphisms of models (Q1317640)

An algorithmic construction is described which transforms functional trees into models such that these models are rigid if and only if the tree possesses an infinite branch. As a consequence of this, a series of results like ``\(\{n\mid R_ n\) is rigid\} is a \(\Pi_ 1^ 1\)-complete set'' are proved, where \(R_ n\) is some very natural enumeration of r.e. binary predicates. Methodologically we obtain that some results on functional trees may be interpreted in terms of automorphisms of models; for example, a recursive model is constructed each of whose hyperarithmetic copies has no hyperarithmetical automorphisms, but whose automorphism group has power \(2^ \omega\).