| Title: | A recursively defined ordering for proving termination of term rewriting systems |
| Author: | Plaisted, David A. |
| Note: | Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978 |
| Link: | page images at HathiTrust |
| No stable link: | This is an uncurated book entry from our extended bookshelves, readable online now but without a stable link here. You should not bookmark this page, but you can request that we add this book to our curated collection, which has stable links. |
| Subject: | Automatic theorem proving |
| Subject: | Electronics digital computers -- Programming |
| Subject: | Recursion theory |
| Other copies: | Look for editions of this book at your library, or elsewhere. |
Help with reading books -- Report a bad link -- Suggest a new listing
Home -- Search -- New Listings -- Authors -- Titles -- Subjects -- Serials
Books -- News -- Features -- Archives -- The Inside Story
Edited by John Mark Ockerbloom (onlinebooks@pobox.upenn.edu)
OBP copyrights and licenses.