Results 1  10
of
12
ORDERINGS OF MONOMIAL IDEALS
, 2003
"... We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular, we give an interpretation of the height function in terms of the HilbertSamuel polynomial, and we compute upper and lower bounds on the maximal order type.
Termination Analysis based on Operational Semantics
, 1995
"... In principle termination analysis is easy: find a wellfounded partial order and prove that calls decrease with respect to this order. In practice this often requires an oracle (or a theorem prover) for determining the wellfounded order and this oracle may not be easily implementable. Our approach ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In principle termination analysis is easy: find a wellfounded partial order and prove that calls decrease with respect to this order. In practice this often requires an oracle (or a theorem prover) for determining the wellfounded order and this oracle may not be easily implementable. Our approach circumvents some of these problems by exploiting the inductive definition of algebraic data types and using pattern matching as in functional languages. We develop a termination analysis for a higherorder functional language; the analysis incorporates and extends polymorphic type inference and axiomatizes a class of wellfounded partial orders for multipleargument functions (as in Standard ML and Miranda). Semantics is given by means of operational (naturalstyle) semantics and soundness is proved; this involves making extensions to the semantic universe and we relate this to the techniques of denotational semantics. For dealing with the partiality aspects of the soundness proof it suffice...
The Theory of Total Unary Rpo is Decidable
, 2000
"... theory of the recursive path ordering is decidable in the case of unary signatures with total precedence. This solves a problem that was mentioned as open in [6]. The result has to be contrasted with the undecidability results of the lexicographic path ordering [6] for the case of symbols with arit ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
theory of the recursive path ordering is decidable in the case of unary signatures with total precedence. This solves a problem that was mentioned as open in [6]. The result has to be contrasted with the undecidability results of the lexicographic path ordering [6] for the case of symbols with arity 2 and total precedence and for the case of unary signatures with partial precedence. We recall that lexicographic path ordering (lpo) and the recursive path ordering and many other orderings such as [13, 10] coincide in the unary case. Among the positive results it is known that the existential theory of total lpo is decidable [3, 17]. The same result holds for the case of total rpo [8, 15]. The proof technique we use for our decidability result might be interesting by itself. It relies on encoding of words as trees and then on building a tree automaton to recognize the rpo relation. Key words: Recursive path ordering, firstorder theory, ground reducibility
A Poset Classifying NonCommutative Term Orders
"... We study a poset N on the free monoid X on a countable alphabet X This poset is determined by the fact that its total extensions are precisely the standard termorders on X We also investigate the poset classifying degreecompatible standard termorders, and the poset classifying sorted termorder ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study a poset N on the free monoid X on a countable alphabet X This poset is determined by the fact that its total extensions are precisely the standard termorders on X We also investigate the poset classifying degreecompatible standard termorders, and the poset classifying sorted termorders. For the latter poset, we give a Galois coconnection with the Young lattice. 1.
The Classification of Polynomial Orderings on Monadic Terms
 Applicable Algebra in Engineering, Communication and Computing
, 1998
"... We investigate, for the case of unary function symbols, polynomial orderings on term algebras, that is reduction orderings determined by polynomial interpretations of the function symbols. Any total reduction ordering over unary function symbols can be characterised in terms of numerical invaria ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We investigate, for the case of unary function symbols, polynomial orderings on term algebras, that is reduction orderings determined by polynomial interpretations of the function symbols. Any total reduction ordering over unary function symbols can be characterised in terms of numerical invariants determined by the ordering alone: we show that for polynomial orderings these invariants, and in some cases the ordering itself, are essentially determined by the degrees and leading coefficients of the polynomial interpretations. Hence any polynomial ordering has a much simpler description, and thus the apparent complexity and variety of these orderings is less than it might seem at first sight.
A Complex Example of a Simplifying Rewrite System
"... . For a string rewriting system, it is known that termination by a simplification ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simplific ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. For a string rewriting system, it is known that termination by a simplification ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simplification yield a primitive recursive bound. Furthermore, the study of the order types of simplification orderings suggests that the recursive path ordering is, in a broad sense, a maximal simplification ordering. This would imply that simplifying string rewrite systems cannot go beyond primitive recursion. Contradicting this intuition, we construct here a simplifying string rewriting system whose complexity is not primitive recursive. This leads to a new lower bound for the complexity of simplifying string rewriting systems. Introduction Rewriting systems serve as a model of computation in many fields of theoretical computer science, for instance automated theorem proving, algebraic specificat...
doi:10.1006/inco.2002.3160 A Characterisation of Multiply Recursive Functions with Higman’s Lemma
, 1999
"... We prove that string rewriting systems which reduce by Higman’s lemma exhaust the multiply recursive functions. This result provides a full characterisation of the expressiveness of Higman’s lemma when applied to rewriting theory. The underlying argument of our construction is to connect the order t ..."
Abstract
 Add to MetaCart
We prove that string rewriting systems which reduce by Higman’s lemma exhaust the multiply recursive functions. This result provides a full characterisation of the expressiveness of Higman’s lemma when applied to rewriting theory. The underlying argument of our construction is to connect the order type and the derivation length via the Hardy hierarchy. C ○ 2002 Elsevier Science (USA) 1.
Abstract Leanest QuasiOrderings
"... A convenient method for defining a quasiordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasiorderings satisfying some desired traits. Unfortunately, a minimum in terms of set inclusion can be nonexistent even when an intuitive “minimum ” ex ..."
Abstract
 Add to MetaCart
A convenient method for defining a quasiordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasiorderings satisfying some desired traits. Unfortunately, a minimum in terms of set inclusion can be nonexistent even when an intuitive “minimum ” exists. We suggest an alternative to set inclusion, called “leanness”, show that leanness is a partial order on quasiorderings, and provide sufficient conditions for the existence of a “leanest ” member of a set of total wellfounded quasiorderings. Key words: Quasiordering, wellquasiordering, lexicographic path ordering 1
free
"... Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a ..."
Abstract
 Add to MetaCart
Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a