The Ascending Tree Condition: Constructive Algebra Without Countable Choice
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- does not imply the existence of a Suslin tree
- Noetherian orders
- Do Noetherian modules have Noetherian basis functions?
- Variations on Noetherianness
- Constructing Gröbner bases for Noetherian rings
- A constructive picture of Noetherian conditions and well quasi-orders
- An iterative constructive Hilbert basis theorem
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
This page was built for publication: The Ascending Tree Condition: Constructive Algebra Without Countable Choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804864)