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

Publisher： Elsevier

ISSN： 0304-3975

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The first-order theory of lexicographic path orderings is undecidable

By Comon H. Treinen R.

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 67-87

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

First-order spectra with one binary predicate

By Durand A. Ranaivoson S.

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 305-320

Elsevier

Access to resources Recommend Favorite

Stabilisation and control of unstable first-order linear delay systems

By Del-Muro-Cuellar B. Marquez-Rubio J.F. Velasco-Villa M. Alvarez-Ramirez J.

International Journal of Computer Applications in Technology, Vol. 41, Iss. 1-2, 2011-09 ,pp. : 84-90

Inderscience Publishers

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