AbstractThis paper defines a presupposition‐free many‐sorted tense theory MQRT*=. This theory is applied to behavior description of historical database. Using this theory makes it possible to express clearly not only the usual schema information but also such behavioral aspects of schema as event, dynamic integrity constraint, etc. This is the first time behavior description has been provided by a complete theory. This theory is also applied to schema description of historical database. Providing both schema description and behavior description amounts to total, full description of historical datab