ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
39
views
51
references
Top references
cited by
65
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
769
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Termination of rewriting
Author(s):
Nachum Dershowitz
Publication date
Created:
February 1987
Publication date
(Print):
February 1987
Journal:
Journal of Symbolic Computation
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Further versions
open (via crossref license)
Powered by
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
ScienceOpen Research
Most cited references
51
Record
: found
Abstract
: not found
Article
: not found
Ordering by Divisibility in Abstract Algebras
Graham Higman
(1952)
0
comments
Cited
141
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
George E. Collins
(1975)
0
comments
Cited
118
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On Theories with a Combinatorial Definition of "Equivalence"
M. Newman
(1942)
0
comments
Cited
84
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Journal of Symbolic Computation
Abbreviated Title:
Journal of Symbolic Computation
Publisher:
Elsevier BV
ISSN (Print):
07477171
Publication date Created:
February 1987
Publication date (Print):
February 1987
Volume
: 3
Issue
: 1-2
Pages
: 69-115
Article
DOI:
10.1016/S0747-7171(87)80022-6
SO-VID:
87220fe2-5924-4f3c-8547-d4c2b796cc3c
Copyright ©
© 1987
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
769
Graph rewriting with polarized cloning
Authors:
Frederic Prost
,
Rachid Echahed
,
Dominique Duval
Teaching how to prepare a manuscript by means of rewriting published scientific papers.
Authors:
Lubomir Tomaska
Rewriting the rules of the American economy: An agenda for growth and shared prosperity
Authors:
E STIGLITZ J
,
Joseph E Stiglitz
,
Stiglitz J.
…
See all similar
Cited by
65
Mechanizing and Improving Dependency Pairs
Authors:
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
…
Proving and Disproving Termination of Higher-Order Functions
Authors:
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
Automated Termination Proofs with AProVE
Authors:
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
…
See all cited by
Most referenced authors
105
L. C. de A. Williams
G Collins
D. Haussler
See all reference authors