Author： Stannett Mike Németi István
Publisher： Springer Publishing Company
ISSN： 0168-7433
Source： Journal of Automated Reasoning, Vol.52, Iss.4, 2014-04, pp. : 361-378
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
A behavioural theory of first-order CML
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :
Design of abstract domains using first-order logic
By Marchiori E.
Theoretical Computer Science, Vol. 222, Iss. 1, 1999-07 ,pp. :
The first-order theory of linear one-step rewriting is undecidable
By Treinen R.
Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. :