LQTL Lean Quaternary Temporal Logic: a terse form of temporal logic created by assigning four descriptors such that false, becoming true, true and becoming false are represented and become a linear sequence. In a branching tree two alternative are open, change or no change. The integer sequence above is the count of the row possibilities of the four states over successive iterations.

A094266

LQTL Lean Quaternary Temporal Logic: a terse form of temporal logic created by assigning four descriptors such that false, becoming true, true and becoming false are represented and become a linear sequence. In a branching tree two alternative are open, change or no change. The integer sequence above is the count of the row possibilities of the four states over successive iterations.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =0a(4) =1a(5) =2a(6) =1a(7) =0a(8) =1a(9) =3a(10) =3a(11) =1a(12) =2a(13) =4a(14) =6a(15) =4a(16) =6a(17) =6a(18) =10a(19) =10a(20) =16a(21) =12a(22) =16a(23) =20a(24) =36a(25) =28a(26) =28a(27) =36a(28) =72a(29) =64

External references