Admissible inference rules of temporal intransitive logic with the operator "tomorrow"

We investigates non-transitive temporal logic with the "tomorrow" operator. In this logic, the operator "necessary" $\Box$ coincides with the operator “possible” $\Diamond$ (or almost coincides in reflexive case). In addition to the basic properties of the reflexive non-transitive logic ${{\mathcal L}}^r$ (decidability, finite approximability), admissible rules of this logic are investigated. The main result consists in proving the structural completeness of this logic and its tabular extensions.