The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The temporal logic given by Manna and Pnueli for concurrent program verification has been investigated, whose time structure is isomorphic to natural number set and the operators are , , , U. By analyzing the main methods of the temporal theorem proving, their disadvantages have been revealed, for which a sequent system of propositional temporal logic (PTL) has been established and its soundness and completeness has been proved.