The computational complexity of module socles

This paper studies the computational complexity of socles of modules from the viewpoint of computability theory. The socle Soc(M) of a module M over a commutative ring R is the sum of all simple submodules of M. Soc(M) plays a vital role in module theory and it is known as the largest semisimple sub...

Full description

Saved in:
Bibliographic Details
Published in:Annals of pure and applied logic Vol. 173; no. 5; p. 103089
Main Author: Wu, Huishan
Format: Journal Article
Language:English
Published: Elsevier B.V 01.05.2022
Subjects:
ISSN:0168-0072
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper studies the computational complexity of socles of modules from the viewpoint of computability theory. The socle Soc(M) of a module M over a commutative ring R is the sum of all simple submodules of M. Soc(M) plays a vital role in module theory and it is known as the largest semisimple submodule of M. Socles of Z-modules (i.e., abelian groups) are Σ10 and there is a computable abelian group G such that Soc(G) is Σ10-complete. Socles of R-modules are Σ30. We show that there is a computable module M over a computable commutative ring R such that Soc(M) is Σ30-complete.
AbstractList This paper studies the computational complexity of socles of modules from the viewpoint of computability theory. The socle Soc(M) of a module M over a commutative ring R is the sum of all simple submodules of M. Soc(M) plays a vital role in module theory and it is known as the largest semisimple submodule of M. Socles of Z-modules (i.e., abelian groups) are Σ10 and there is a computable abelian group G such that Soc(G) is Σ10-complete. Socles of R-modules are Σ30. We show that there is a computable module M over a computable commutative ring R such that Soc(M) is Σ30-complete.
ArticleNumber 103089
Author Wu, Huishan
Author_xml – sequence: 1
  givenname: Huishan
  orcidid: 0000-0002-0698-7649
  surname: Wu
  fullname: Wu, Huishan
  email: huishanwu@blcu.edu.cn
  organization: School of Information Science, Beijing Language and Culture University, Beijing 100083, China
BookMark eNp9j8tqwzAQRbVIoUnaH-jKP-B0JLl-QDcl9AWBbtK1GMsjKiNbRnJK8_d16q6yyGq4dzjDnBVb9L4nxu44bDjw_L7d4IBuI0CIqZBQVgu2nBZlClCIa7aKsQWAh6yQS5buvyjRvhsOI47W9-j-kqMfOx4Tb5LONwdHSfTaUbxhVwZdpNv_uWafL8_77Vu6-3h93z7tUi0kjCnHoiLMcw2YQZmZgipdF0ZOmZeIpiLCjKAxU81ryGqStREyLwjqBupKrlk539XBxxjIKG3n_8aA1ikO6qSqWnVSVSdVNatOqDhDh2A7DMfL0OMM0ST1bSmoqC31mhobSI-q8fYS_gsXo3JP
CitedBy_id crossref_primary_10_3390_math12223608
Cites_doi 10.1215/00294527-2019-0036
10.1017/S0004972700031014
10.1090/proc/12509
10.1016/0003-4843(79)90011-1
10.1215/00294527-2021-0017
10.1007/978-3-642-31933-4
10.1016/j.jalgebra.2007.02.058
10.1016/j.jalgebra.2009.07.039
10.1016/0003-4843(77)90015-8
10.1017/bsl.2014.32
ContentType Journal Article
Copyright 2022 Elsevier B.V.
Copyright_xml – notice: 2022 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.apal.2022.103089
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Philosophy
ExternalDocumentID 10_1016_j_apal_2022_103089
S0168007222000033
GroupedDBID --K
--M
-ET
-~X
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
ABAOU
ABFNM
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AETEA
AEXQZ
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HZ~
H~9
IHE
IXB
J1W
KOM
M26
M41
MHUIS
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
TN5
WH7
WUQ
XJT
YYP
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADMHG
ADNMO
ADVLN
ADXHL
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c230t-1a79ea66c0a4084f7e9cb7f3c0a18aaf9eea4e0df9cb1b04be3bf2367e0bd0b93
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000795798500008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0168-0072
IngestDate Tue Nov 18 22:06:22 EST 2025
Sat Nov 29 07:23:44 EST 2025
Fri Feb 23 02:40:14 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords 68Q15
Computability theory
03D80
68Q17
Socles of modules
Simple module
03D15
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c230t-1a79ea66c0a4084f7e9cb7f3c0a18aaf9eea4e0df9cb1b04be3bf2367e0bd0b93
ORCID 0000-0002-0698-7649
ParticipantIDs crossref_citationtrail_10_1016_j_apal_2022_103089
crossref_primary_10_1016_j_apal_2022_103089
elsevier_sciencedirect_doi_10_1016_j_apal_2022_103089
PublicationCentury 2000
PublicationDate May 2022
2022-05-00
PublicationDateYYYYMMDD 2022-05-01
PublicationDate_xml – month: 05
  year: 2022
  text: May 2022
PublicationDecade 2020
PublicationTitle Annals of pure and applied logic
PublicationYear 2022
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Anderson, Fuller (br0100) 1992; vol. 13
Nies (br0140) 2009
Soare (br0160) 2016
Frohlich, Shepherdson (br0010) 1956; 248
Lempp (br0050) 1997; 56
Metakides, Nerode (br0040) 1979; 17
Wu (br0130) 2020; 61
Conidis (br0110) 2021; 62
Soare (br0150) 1987
Downey, Lempp, Mileti (br0080) 2007; 314
Lam (br0120) 2001; vol. 131
Melnikov (br0060) 2014; 20
Metakides, Nerode (br0030) 1977; 11
Conidis (br0090) 2009; 322
Riggs (br0070) 2015; 143
Rabin (br0020) 1960; 95
Soare (10.1016/j.apal.2022.103089_br0150) 1987
Lempp (10.1016/j.apal.2022.103089_br0050) 1997; 56
Conidis (10.1016/j.apal.2022.103089_br0110) 2021; 62
Wu (10.1016/j.apal.2022.103089_br0130) 2020; 61
Frohlich (10.1016/j.apal.2022.103089_br0010) 1956; 248
Conidis (10.1016/j.apal.2022.103089_br0090) 2009; 322
Nies (10.1016/j.apal.2022.103089_br0140) 2009
Metakides (10.1016/j.apal.2022.103089_br0030) 1977; 11
Downey (10.1016/j.apal.2022.103089_br0080) 2007; 314
Rabin (10.1016/j.apal.2022.103089_br0020) 1960; 95
Riggs (10.1016/j.apal.2022.103089_br0070) 2015; 143
Anderson (10.1016/j.apal.2022.103089_br0100) 1992; vol. 13
Soare (10.1016/j.apal.2022.103089_br0160) 2016
Metakides (10.1016/j.apal.2022.103089_br0040) 1979; 17
Lam (10.1016/j.apal.2022.103089_br0120) 2001; vol. 131
Melnikov (10.1016/j.apal.2022.103089_br0060) 2014; 20
References_xml – volume: 11
  start-page: 147
  year: 1977
  end-page: 171
  ident: br0030
  article-title: Recursicely enumerable vector spaces
  publication-title: Ann. Math. Log.
– volume: 20
  start-page: 315
  year: 2014
  end-page: 356
  ident: br0060
  article-title: Computable Abelian groups
  publication-title: Bull. Symb. Log.
– volume: 248
  start-page: 407
  year: 1956
  end-page: 432
  ident: br0010
  article-title: Effective procedures in field theory
  publication-title: Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci.
– volume: 17
  start-page: 289
  year: 1979
  end-page: 320
  ident: br0040
  article-title: Effective content of field theory
  publication-title: Ann. Math. Log.
– volume: vol. 13
  year: 1992
  ident: br0100
  article-title: Rings and Categories of Modules
  publication-title: Graduate Texts in Mathematics
– year: 2016
  ident: br0160
  article-title: Turing Computability, Theory and Applications of Computability
– volume: 322
  start-page: 3670
  year: 2009
  end-page: 3680
  ident: br0090
  article-title: On the complexity of radicals in noncommutative rings
  publication-title: J. Algebra
– volume: 62
  start-page: 353
  year: 2021
  end-page: 368
  ident: br0110
  article-title: The complexity of module radicals
  publication-title: Notre Dame J. Form. Log.
– year: 2009
  ident: br0140
  article-title: Computability and Randomness
– volume: 143
  start-page: 3631
  year: 2015
  end-page: 3640
  ident: br0070
  article-title: The decomposability problem for torsion-free Abelian groups is analytic-complete
  publication-title: Proc. Am. Math. Soc.
– volume: 314
  start-page: 872
  year: 2007
  end-page: 887
  ident: br0080
  article-title: Ideals in commutative rings
  publication-title: J. Algebra
– year: 1987
  ident: br0150
  article-title: Recursively Enumerable Sets and Degrees
– volume: 56
  start-page: 273
  year: 1997
  end-page: 277
  ident: br0050
  article-title: The computational complexity of torsion-freeness of finitely presented groups
  publication-title: Bull. Aust. Math. Soc.
– volume: 61
  start-page: 141
  year: 2020
  end-page: 153
  ident: br0130
  article-title: The complexity of radicals and socles of modules
  publication-title: Notre Dame J. Form. Log.
– volume: 95
  start-page: 341
  year: 1960
  end-page: 360
  ident: br0020
  article-title: Computable algebra, general theory and theory of computable fields
  publication-title: Trans. Am. Math. Soc.
– volume: vol. 131
  year: 2001
  ident: br0120
  article-title: A First Course in Noncommutative Rings
  publication-title: Graduate Texts in Mathematics
– volume: 61
  start-page: 141
  year: 2020
  ident: 10.1016/j.apal.2022.103089_br0130
  article-title: The complexity of radicals and socles of modules
  publication-title: Notre Dame J. Form. Log.
  doi: 10.1215/00294527-2019-0036
– volume: 56
  start-page: 273
  year: 1997
  ident: 10.1016/j.apal.2022.103089_br0050
  article-title: The computational complexity of torsion-freeness of finitely presented groups
  publication-title: Bull. Aust. Math. Soc.
  doi: 10.1017/S0004972700031014
– volume: 143
  start-page: 3631
  year: 2015
  ident: 10.1016/j.apal.2022.103089_br0070
  article-title: The decomposability problem for torsion-free Abelian groups is analytic-complete
  publication-title: Proc. Am. Math. Soc.
  doi: 10.1090/proc/12509
– volume: 17
  start-page: 289
  year: 1979
  ident: 10.1016/j.apal.2022.103089_br0040
  article-title: Effective content of field theory
  publication-title: Ann. Math. Log.
  doi: 10.1016/0003-4843(79)90011-1
– year: 1987
  ident: 10.1016/j.apal.2022.103089_br0150
– volume: 62
  start-page: 353
  year: 2021
  ident: 10.1016/j.apal.2022.103089_br0110
  article-title: The complexity of module radicals
  publication-title: Notre Dame J. Form. Log.
  doi: 10.1215/00294527-2021-0017
– year: 2016
  ident: 10.1016/j.apal.2022.103089_br0160
  doi: 10.1007/978-3-642-31933-4
– volume: 314
  start-page: 872
  year: 2007
  ident: 10.1016/j.apal.2022.103089_br0080
  article-title: Ideals in commutative rings
  publication-title: J. Algebra
  doi: 10.1016/j.jalgebra.2007.02.058
– volume: 322
  start-page: 3670
  year: 2009
  ident: 10.1016/j.apal.2022.103089_br0090
  article-title: On the complexity of radicals in noncommutative rings
  publication-title: J. Algebra
  doi: 10.1016/j.jalgebra.2009.07.039
– volume: 11
  start-page: 147
  year: 1977
  ident: 10.1016/j.apal.2022.103089_br0030
  article-title: Recursicely enumerable vector spaces
  publication-title: Ann. Math. Log.
  doi: 10.1016/0003-4843(77)90015-8
– volume: vol. 13
  year: 1992
  ident: 10.1016/j.apal.2022.103089_br0100
  article-title: Rings and Categories of Modules
– volume: 248
  start-page: 407
  year: 1956
  ident: 10.1016/j.apal.2022.103089_br0010
  article-title: Effective procedures in field theory
  publication-title: Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci.
– volume: vol. 131
  year: 2001
  ident: 10.1016/j.apal.2022.103089_br0120
  article-title: A First Course in Noncommutative Rings
– volume: 20
  start-page: 315
  year: 2014
  ident: 10.1016/j.apal.2022.103089_br0060
  article-title: Computable Abelian groups
  publication-title: Bull. Symb. Log.
  doi: 10.1017/bsl.2014.32
– year: 2009
  ident: 10.1016/j.apal.2022.103089_br0140
– volume: 95
  start-page: 341
  year: 1960
  ident: 10.1016/j.apal.2022.103089_br0020
  article-title: Computable algebra, general theory and theory of computable fields
  publication-title: Trans. Am. Math. Soc.
SSID ssj0005473
Score 2.2708094
Snippet This paper studies the computational complexity of socles of modules from the viewpoint of computability theory. The socle Soc(M) of a module M over a...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 103089
SubjectTerms Computability theory
Simple module
Socles of modules
Title The computational complexity of module socles
URI https://dx.doi.org/10.1016/j.apal.2022.103089
Volume 173
WOSCitedRecordID wos000795798500008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0168-0072
  databaseCode: AIEXJ
  dateStart: 20211209
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0005473
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEB509aAH8YlvevAmlfSxTXIUUVRUBB_srSTZBJS1u-xD1n_vpEm7vhAVvIQ2NE2Zb0gnk5n5APbitpTEKBFmimUhKgUPZWrsIa_IWJObiJYnuvcX9OqKtVr82vOEDko6AVoUbDzmvX-FGvsQbJs6-wu465diB14j6Ngi7Nj-GHhVcjVUfr4ybFyPffDFU7c96mjrLO_4-MFPtZR71amC8DZquUDW6_eo_F-NLG9z8dZrgBvOOkbPubI-pbM472LGQltL_N3y6KhGvB40v1x2nQfg8QD_7_Y4J45tLj9x3EAfylnf2EnsHLFNEiJJMg0zMW1y1oCZw7Pj1vkkQCd18QHVR_mUJxed93Gmr82KN6bC7SIseBs_OHTYLMGULpZh_rIukDtYhrnrikLiZQVChCx4B1kwgSzomsBBFjjIVuHu5Pj26DT0NBahwv3dMIwE5VpkmSIiJSw1VHMlqUnwPmJCGK61SDVpG-yOJEmlTqSxhfU0kW0iebIGjaJb6HUIMiGYxC15SrFlJuZamgzfSBShUii6AVElhVz5Gu-WaqSTV8F8j7mVXG4llzvJbcB-PabnKpx8-3SzEm7ubTRne-WoC9-M2_zjuC2Ym6jvNjSG_ZHegVn1PHwY9He9yrwC9ztgvg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+computational+complexity+of+module+socles&rft.jtitle=Annals+of+pure+and+applied+logic&rft.au=Wu%2C+Huishan&rft.date=2022-05-01&rft.pub=Elsevier+B.V&rft.issn=0168-0072&rft.volume=173&rft.issue=5&rft_id=info:doi/10.1016%2Fj.apal.2022.103089&rft.externalDocID=S0168007222000033
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-0072&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-0072&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-0072&client=summon