Title of article :
The logic of “initially” and “next”: Complete axiomatization and complexity
Author/Authors :
P. -Y. Schobbens، نويسنده , , J. -F. Raskin، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Keywords :
computational complexity , Complete axiomatization , Automatic theorem proving: Program specification , Temporal logic
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters