Definability a family of sets in the graph

Abstract

We constructed a method of definability a family of sets to the oriented graph. Using this method we proved next results: Let A structure of the signature a of the 2 nilpotent group. For each computable ordinal a there is a computable structure A of the signature a that is A a categorical but not relatively Да (and without for¬mally ^a Scott family). For each computable ordinal a there is a computable structure A of the signature a that is R with a relation that is intrinsically ^ a but not relatively intrinsically ^а on A.