![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Cadoli M. Palopoli L.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.193, Iss.1, 1998-02, pp. : 215-244
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the Expressive Power of Joint Input
By Nestmann U.
Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 2, 2004-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the expressive power of counting
Theoretical Computer Science, Vol. 149, Iss. 1, 1995-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Libkin L.
Theoretical Computer Science, Vol. 296, Iss. 3, 2003-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the expressive power of first-order boolean functions in PCF
By Pucella
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. :