Decidability for the theory of modules over a Pr\"ufer domain
Lorna Gregory
TL;DR
This paper characterizes when the theory of modules over a Pr"ufer domain is decidable and demonstrates the decidability for the ring of integer valued polynomials.
Contribution
It provides elementary conditions for decidability of module theories over Pr"ufer domains and applies these to a specific ring.
Findings
Decidability conditions for module theories over Pr"ufer domains
Decidability of the theory of modules over the ring of integer valued polynomials
Elementary criteria for algebraic decision procedures
Abstract
In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is decidable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Oxidative Organic Chemistry Reactions · Magnolia and Illicium research