Orderings of monomial ideals

Fundamenta Mathematicae

Volumn 181, Issue 1, 2004, Pages 27-74

  Aschenbrenner, Matthias ^a,b   Pong, Wai Yan ^a,c  

^a Evans Hall ^*

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042857121     PISSN: 00162736     EISSN: None     Source Type: Journal    
DOI: 10.4064/fm181-1-2     Document Type: Article

References (47)

1. U. Abraham, A note on Dilworth's theorem in the infinite case, Order 4 (1987), 107-125.
2. U. Abraham and R. Bonnet, Hausdorff's theorem for posets that satisfy the finite antichain property, Fund. Math. 159 (1999), 51-69.
3. M. Aschenbrenner and R. Hemmecke, A finiteness theorem in stochastic integer programming, in preparation, 2003.
4. M. Aschenbrenner and W. Y. Pong, The differential order, in preparation, 2003.
5. H. Bachmann, Transfinite Zahlen, Ergeb. Math. Grenzgeb. 1, Springer, Berlin, 1955.
6. T. Becker and V. Weispfenning, Gröbner Bases, Grad. Texts in Math. 141, Springer, New York, 1993.
7. R. Bonnet et M. Pouzet, Extension et stratification d'ensembles dispersés, C. R. Acad. Sci. Paris Sér. A-B 268 (1969), A1512-A1515.
8. G. Brookfield, The length of Noetherian modules, Comm. Algebra 30 (2002), 3177-3204.
9. L. E. J. Brouwer, Beweis, daß jede volle Funktion gleichmässig stetig ist, Nederl. Akad. Wetensch. Proc. Ser. B 27 (1924), 189-193.
10. W. Bruns and J. Herzog, Cohen-Macaulay Rings, Cambridge Stud. Adv. Math. 39, Cambridge Univ. Press, Cambridge, 1993.
11. D. de Jongh and R. Parikh, Well-partial orderings and hierarchies, Indag. Math. 39 (1977), 195-207.
12. N. Dershowitz, Termination of rewriting, J. Symbolic Comput. 3 (1987), 69-115.
13. R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Math. (2) 51 (1950), 161-166.
14. T. Dubé, The structure of polynomial ideals and Gröbner bases, SIAM J. Comput. 19 (1990), 750-775.
15. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Grad. Texts in Math. 150, Springer, New York, 1995.
16. R. Fraïssé, Theory of Relations, revised ed., Stud. Logic Found. Math. 145, North-Holland, Amsterdam, 2000.
17. H. Friedman, The Ackermann function in elementary algebraic geometry, manuscript, 1999.
18. 0? A survey of some results in proof theory, Ann. Pure Appl. Logic 53 (1991), 199-260.
19. G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc. (3) 2 (1952), 326-336.
20. A. S. Kechris, Classical Descriptive Set Theory, Grad. Texts in Math. 156, Springer, New York, 1995.
21. S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals. II, Amer. J. Math. 77 (1955), 405-428.
22. E. Kolchin, Differential Algebra and Algebraic Groups, Pure and Appl. Math. 54, Academic Press, New York-London, 1973.
23. M. V. Kondratieva, A. B. Levin, A. V. Mikhalev, and E. V. Pankratiev, Differential and Difference Dimension Polynomials, Math. Appl. 461, Kluwer, Dordrecht, 1999.
24. I. Kříž and R. Thomas, Ordinal types in Ramsey theory and well-partial-ordering theory, in [34], 57-95.
25. J. B. Kruskal, The theory of well-quasi-ordering: A frequently discovered concept, J. Combin. Theory Ser. A 13 (1972), 297-305.
26. N. Lusin et W. Sierpiński, Sur un ensemble non mesurable B, J. Math. Pures Appl. (9) 2 (1923), 53-72.
27. F. S. Macaulay, Some properties of enumeration in the theory of modular systems, Proc. London Math. Soc. 26 (1927), 531-555.
28. D. Maclagan, Antichains of monomial ideals are finite, Proc. Amer. Math. Soc. 129 (2001), 1609-1615.
29. U. Martin and E. Scott, The order types of termination orderings on monadic terms, strings and multisets, J. Symbolic Logic 62 (1997), 624-635.
30. G. Moreno Socías, Length of polynomial ascending chains and primitive recursiveness, Math. Scand. 71 (1992), 181-205.
31. Y. N. Moschovakis, Descriptive Set Theory, Stud. Logic Found. Math. 100, North-Holland, Amsterdam, 1980.
32. C. St. J. A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963), 833-835.
33. _, On well-quasi-ordering infinite trees, ibid. 61 (1965), 697-720.
34. R. Nešetřil and V. Rödl (eds.), Mathematics of Ramsey Theory, Algorithms Combin. 5, Springer, Berlin, 1990.
35. M. Perles, On Dilworth's theorem in the infinite case, Israel J. Math. 1 (1963), 108-109.
36. R. Rado, Partial well-ordering of sets of vectors, Mathematika 1 (1954), 89-95.
37. L. Robbiano, Term orderings on the polynomial ring, in: EUROCAL '85, Vol. 2 (Linz, 1985), Lecture Notes in Comput. Sci. 204, Springer, Berlin, 1985, 513-517.
38. C. J. Rust, Rankings of Derivatives for Elimination Algorithms and Formal Solvability of Analytic Partial Differential Equations, Ph.D. thesis, Univ. of Chicago, 1998.
39. D. Schmidt, Well-Partial Orderings and Their Maximal Order Types, Habilitationsschrift, Math. Inst., Univ. Heidelberg, 1979.
40. S. Simpson, Subsystems of Second Order Arithmetic, Perspectives in Math. Logic, Springer, Berlin, 1999.
41. W. Sit, Well ordering of certain numerical polynomials, Trans. Amer. Math. Soc. 212 (1975), 37-45.
42. B. Sturmfels, Gröbner Bases and Convex Polytopes, Univ. Lecture Ser. 8, Amer. Math. Soc., Providence, RI, 1996.
43. L. van den Dries and P. Ehrlich, Fields of surreal numbers and exponentiation, Fund. Math. 167 (2001), 173-188.
44. _, _, Erratum to [43], ibid. 168 (2001), 295-297.
45. J. van der Hoeven, Asymptotique automatique, Ph.D. thesis, École Polytechnique, Paris, 1997.
46. A. Weiermann, Proving termination for term rewriting systems, in: Computer Science Logic (Berne, 1991), Lecture Notes in Comput. Sci. 626, Springer, Berlin, 1992, 419-428.
47. E. S. Wolk, Partially well ordered sets and partial ordinals, Fund. Math. 60 (1967), 175-186.