Length of Polynomial Ascending Chains and Primitive Recursiveness.
From MaRDI portal
Recommendations
Cited in
(15)- Effective uniform bounding in partial differential fields
- Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems
- Noetherianity and Specht problem for varieties of bicommutative algebras
- A bound for orders in differential Nullstellensatz
- Trajectories of polynomial vector fields and ascending chains of polynomial ideals
- Algebraic tools for computing polynomial loop invariants
- Estimates for the coefficients of differential dimension polynomials
- On the lengths of bad sequences of monomial ideals over polynomial rings
- Well partial orders
- Ideal membership in polynomial rings over the integers
- On bounds for the effective differential Nullstellensatz
- A topological method for finding invariant sets of continuous systems
- Ascending chains of ideals in the polynomial ring
- Proof mining and effective bounds in differential polynomial rings
- Tropical noetherity and Gröbner bases
This page was built for publication: Length of Polynomial Ascending Chains and Primitive Recursiveness.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274103)