Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Information and Computation Unpaywall

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems

Information and ComputationJun 1, 2002

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems

Information and ComputationJun 1, 2002

Loading next page...
 
/lp/unpaywall/the-undecidability-of-the-first-order-theories-of-one-step-rewriting-0huqj7FLSo

References (26)

Publisher
Unpaywall
ISSN
0890-5401
DOI
10.1006/inco.2002.3151
Publisher site
See Article on Publisher Site

Abstract

Journal

Information and ComputationUnpaywall

Published: Jun 1, 2002

There are no references for this article.