Ordinal numbers and the Hilbert basis theorem

DOI10.2307/2274585zbMath0661.03046OpenAlexW2075746519MaRDI QIDQ3809796

Stephen G. Simpson

Publication date: 1988

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.2979

zbMATH Keywords

polynomial ringreverse mathematicsHilbert basis theoremcountable algebraweak subsystems of second order arithmeticwell-partial-orderinginsertive idealsRobson basis theorem

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Axiomatics of classical set theory and its fragments (03E30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem, 2000 Annual Meeting of the Association for Symbolic Logic, A note on ordinal numbers and rings of formal power series, A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, A linear time algorithm for monadic querying of indefinite data over linearly ordered domains, Reverse mathematics of the finite downwards closed subsets of ordered by inclusion and adjacent Ramsey for fixed dimension, The maximal linear extension theorem in second order arithmetic, Proof pearl: a formal proof of Higman's lemma in ACL2, Proof mining and effective bounds in differential polynomial rings, The Reverse Mathematics of wqos and bqos, Dickson's lemma and weak Ramsey theory, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, The ignorance of Bourbaki, Long finite sequences, Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data, Connected components of graphs and reverse mathematics, Two applications of analytic functors, An infinite natural product, Noetherian orders, THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES, REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION, On Fraïssé's conjecture for linear orders of finite Hausdorff rank, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, Reverse mathematics and its meaning

Cites Work

• Fragments of arithmetic
• Countable algebra and set existence axioms
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Well quasi-ordered sets and ideals in free semigroups and algebras
• Polynomials satisfied by matrices
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• Unnamed Item
• Unnamed Item