On the computational aspects of Kripke's theory of truth

We shall discuss how to measure complexity of partial truth predicates arising in Kripke's theory of truth. Аpart from giving a survey of the topic, I shall present a method for proving complexity results in this direction, and show how to use it to obtain some interesting generalisations of known results. This method will be both relatively simple, involving only the basic machinery of constructive ordinals, and rather general.