Author： Ferreira W. Hennessy M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.216, Iss.1, 1999-03, pp. : 55-107
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 first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :
Access to resources
Recommend
The first-order theory of linear one-step rewriting is undecidable
By Treinen R.
Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,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. :