Some efficiently solvable class calculus formulas of temporal and modal logics

The article deals with polynomial algorithms private problems solutions of feasibility formulas of temporal and modal logics with limitation for Kripke structure. There used a game interpretation of feasibility and Zermelo's result about balance in position games with full information.