The first-order theory of linear one-step rewriting is undecidable

By Treinen R.  

Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. : 179-190

Elsevier

Access to resources Recommend Favorite

A behavioural theory of first-order CML

By Ferreira W.   Hennessy M.  

Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. : 55-107

Elsevier

Access to resources Recommend Favorite

The recursive path and polynomial ordering for first-order and higher-order terms

By Bofill Miquel   Borralleras Cristina   Rodrguez-Carbonell Enric   Rubio Albert  

Journal of Logic and Computation, Vol. 23, Iss. 1, 2013-02 ,pp. : 263-305

Oxford University Press

Access to resources Recommend Favorite

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

By Weiermann A.  

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 355-362

Elsevier

Access to resources Recommend Favorite

Using Isabelle/HOL to Verify First-Order Relativity Theory

By Stannett Mike   Németi István  

Journal of Automated Reasoning, Vol. 52, Iss. 4, 2014-04 ,pp. : 361-378

Springer Publishing Company

Access to resources Recommend Favorite