Algorithms and Bounds for Polynomial Rings

Lou van den Dries

Research output: Contribution to journalArticlepeer-review


This chapter discusses algorithms and bounds for polynomial rings. A lemma discussed in the chapter combines with the well-known techniques and results of commutative algebra—local–global principles, Krull's intersection theorem, and the primitive element theorem—to obtain many of the bounds. The chapter describes the nonstandard approach. The results on bounds in their nonstandard formulation express very simple relations between two rings, a polynomial ring K[X] and a certain extension K[X]*. The lemma implies that a number A can be computed from (n,d) such that if f ∞ (f1,…fκ), then f = ∑hifi for certain hi ∞ K[X] of degree at most A.

Original languageEnglish (US)
Pages (from-to)147-157
Number of pages11
JournalStudies in Logic and the Foundations of Mathematics
Issue numberC
StatePublished - Jan 1 1979
Externally publishedYes

ASJC Scopus subject areas

  • Logic


Dive into the research topics of 'Algorithms and Bounds for Polynomial Rings'. Together they form a unique fingerprint.

Cite this