Author： Pucella
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.266, Iss.1, 2001-09, pp. : 543-567
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. :
Access to resources
Recommend
The power of the ''always'' operator in first-order temporal logic
Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. :
A note on first-order projections and games
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
On weighted first-order logics with discounting
By Mandrali Eleni Rahonis George
Acta Informatica, Vol. 51, Iss. 2, 2014-03 ,pp. :
A behavioural theory of first-order CML
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :