模基的复杂性

IF 0.6 3区数学 Q2 LOGIC

Notre Dame Journal of Formal Logic Pub Date : 2021-05-01 DOI:10.1215/00294527-2021-0017

Chris J. Conidis

{"title":"模基的复杂性","authors":"Chris J. Conidis","doi":"10.1215/00294527-2021-0017","DOIUrl":null,"url":null,"abstract":"We construct a computable module M over a computable commutative ring R such that the radical of M, rad(M), defined as the intersection of all proper maximal submodules, is Π1-complete. This shows that in general such radicals are as (logically) complicated as possible and, unlike many other kinds of ring-theoretic radicals, admit no arithmetical definition.","PeriodicalId":51259,"journal":{"name":"Notre Dame Journal of Formal Logic","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Complexity of Module Radicals\",\"authors\":\"Chris J. Conidis\",\"doi\":\"10.1215/00294527-2021-0017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct a computable module M over a computable commutative ring R such that the radical of M, rad(M), defined as the intersection of all proper maximal submodules, is Π1-complete. This shows that in general such radicals are as (logically) complicated as possible and, unlike many other kinds of ring-theoretic radicals, admit no arithmetical definition.\",\"PeriodicalId\":51259,\"journal\":{\"name\":\"Notre Dame Journal of Formal Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Notre Dame Journal of Formal Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1215/00294527-2021-0017\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Notre Dame Journal of Formal Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1215/00294527-2021-0017","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 3

摘要

我们在一个可计算交换环R上构造一个可计算模M，使得M的根rad(M)，定义为所有固有极大子模的交，是Π1-complete。这表明，在一般情况下，这样的根是(逻辑上)尽可能复杂的，不像许多其他种类的环论根，承认没有算术定义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Complexity of Module Radicals

We construct a computable module M over a computable commutative ring R such that the radical of M, rad(M), defined as the intersection of all proper maximal submodules, is Π1-complete. This shows that in general such radicals are as (logically) complicated as possible and, unlike many other kinds of ring-theoretic radicals, admit no arithmetical definition.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Notre Dame Journal of Formal Logic MATHEMATICS-LOGIC

CiteScore

1.00

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： The Notre Dame Journal of Formal Logic, founded in 1960, aims to publish high quality and original research papers in philosophical logic, mathematical logic, and related areas, including papers of compelling historical interest. The Journal is also willing to selectively publish expository articles on important current topics of interest as well as book reviews.