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