This is a second preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in . We introduce two modified definitions of a subformula. In the former one we treat until-formula as indivisible. In the latter one, we extend the set of subformulas of until-formulas by a special disjunctive formula. This is needed to construct a temporal model. We also define an ordered positive-negative pair of finite sequences of formulas (PNP). PNPs represent states of a temporal model.
If the inline PDF is not rendering correctly, you can download the PDF file here.
 Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics 1(2):377-382 1990.
 Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics 1(1):41-46 1990.
 Grzegorz Bancerek. Introduction to trees. Formalized Mathematics 1(2):421-427 1990.
 Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics 1(1):91-96 1990.
 Grzegorz Bancerek. K¨onig’s lemma. Formalized Mathematics 2(3):397-402 1991.
 Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics 1(1):107-114 1990.
 Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. FormalizedMathematics 1(3):529-536 1990.
 Czesław Bylinski. Functions and their basic properties. Formalized Mathematics 1(1):55-65 1990.
 Czesław Bylinski. Functions from a set to a set. Formalized Mathematics 1(1):153-164 1990.