Decidability for the theory of modules over a Prüfer domain

Tools

Gregory, Lorna ORCID: https://orcid.org/0000-0002-5508-7217 (2023) Decidability for the theory of modules over a Prüfer domain. International Mathematics Research Notices, 2023 (19). 16574–16673. ISSN 1073-7928

Preview

PDF (finresgenfinalarXiv) - Accepted Version
Download (722kB) | Preview

Abstract

In this article we give elementary conditions completely characterising when the theory of modules of a Prüfer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is decidable.

Item Type:	Article
Additional Information:	Funding information: This work was supported by PRIN 2017-Mathematical Logic: models, sets, computability prot. 2017NWTM8R_004.
Uncontrolled Keywords:	mathematics(all) ,/dk/atira/pure/subjectarea/asjc/2600
Faculty \ School:	Faculty of Science > School of Mathematics
Related URLs:	https://arxiv.org/abs/2107.05152 http://www.scopus.com/inward/record.url?...
Depositing User:	LivePure Connector
Date Deposited:	15 Dec 2022 04:12
Last Modified:	29 Dec 2023 01:38
URI:	https://ueaeprints.uea.ac.uk/id/eprint/90171
DOI:	10.1093/imrn/rnac318

Downloads

Downloads per month over past year

Actions (login required)

View Item