Summary: In this paper in Notre Dame J. Formal Logic 23, 367-374 (1982; Zbl 0452.03021), J. P. Burgess presented a series of \(U,S\)-tense logics for the case of linear time. The aims of this paper are (i) to show how the methods of proving completeness for \(U,S\)-tense logics developed by Burgess could be applied to the general case of (possibly) nonlinear time; and (ii) to present some results concerning the expressibility of U,S-tense language.