{"id":"https://openalex.org/W1937825932","doi":"https://doi.org/10.1215/00294527-2017-0024","title":"The Complexity of Primes in Computable Unique Factorization Domains","display_name":"The Complexity of Primes in Computable Unique Factorization Domains","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W1937825932","doi":"https://doi.org/10.1215/00294527-2017-0024","mag":"1937825932"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2017-0024","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2017-0024","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-2/The-Complexity-of-Primes-in-Computable-Unique-Factorization-Domains/10.1215/00294527-2017-0024.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-2/The-Complexity-of-Primes-in-Computable-Unique-Factorization-Domains/10.1215/00294527-2017-0024.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027589956","display_name":"Damir D. Dzhafarov","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Damir D. Dzhafarov","raw_affiliation_strings":["Dzhafarov Department of Mathematics University of Connecticut Storrs, Connecticut 06269 USA","Department of Mathematics, Department of Mathematics, University of Connecti-cut, Storrs, Connecticut 06269 U.S.A","Department of Mathematics and Statistics, Grinnell College, Grinnell, Iowa 50112 U.S.A"],"affiliations":[{"raw_affiliation_string":"Dzhafarov Department of Mathematics University of Connecticut Storrs, Connecticut 06269 USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Department of Mathematics, Department of Mathematics, University of Connecti-cut, Storrs, Connecticut 06269 U.S.A","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Grinnell College, Grinnell, Iowa 50112 U.S.A","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085592845","display_name":"Joseph R. Mileti","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph R. Mileti","raw_affiliation_strings":["Dzhafarov Department of Mathematics University of Connecticut Storrs, Connecticut 06269 USA","Department of Mathematics and Statistics, Grinnell College, Grinnell, Iowa 50112 U.S.A","Department of Mathematics, Department of Mathematics, University of Connecti-cut, Storrs, Connecticut 06269 U.S.A"],"affiliations":[{"raw_affiliation_string":"Dzhafarov Department of Mathematics University of Connecticut Storrs, Connecticut 06269 USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Grinnell College, Grinnell, Iowa 50112 U.S.A","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics, Department of Mathematics, University of Connecti-cut, Storrs, Connecticut 06269 U.S.A","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085592845"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.6412,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69305041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"59","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11703","display_name":"Rings, Modules, and Algebras","score":0.9596999883651733,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9287999868392944,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unique-factorization-domain","display_name":"Unique factorization domain","score":0.7423936128616333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7196471095085144},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6630828380584717},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6291326284408569},{"id":"https://openalex.org/keywords/prime-factor","display_name":"Prime factor","score":0.5684342980384827},{"id":"https://openalex.org/keywords/computable-number","display_name":"Computable number","score":0.5675654411315918},{"id":"https://openalex.org/keywords/algebraic-number-field","display_name":"Algebraic number field","score":0.5356143712997437},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.531938374042511},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5130518674850464},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.48263368010520935},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46862131357192993},{"id":"https://openalex.org/keywords/integer-factorization","display_name":"Integer factorization","score":0.4609999656677246},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4601931869983673},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45912966132164},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4365791082382202},{"id":"https://openalex.org/keywords/integral-domain","display_name":"Integral domain","score":0.4345620572566986},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4207048714160919},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.3007281422615051},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2655808925628662},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2638895809650421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24091356992721558},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.14723315834999084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10132274031639099}],"concepts":[{"id":"https://openalex.org/C185592164","wikidata":"https://www.wikidata.org/wiki/Q1052579","display_name":"Unique factorization domain","level":3,"score":0.7423936128616333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7196471095085144},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6630828380584717},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6291326284408569},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.5684342980384827},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.5675654411315918},{"id":"https://openalex.org/C12657307","wikidata":"https://www.wikidata.org/wiki/Q616608","display_name":"Algebraic number field","level":2,"score":0.5356143712997437},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.531938374042511},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5130518674850464},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.48263368010520935},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46862131357192993},{"id":"https://openalex.org/C119677069","wikidata":"https://www.wikidata.org/wiki/Q4846249","display_name":"Integer factorization","level":4,"score":0.4609999656677246},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4601931869983673},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45912966132164},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4365791082382202},{"id":"https://openalex.org/C98486379","wikidata":"https://www.wikidata.org/wiki/Q628792","display_name":"Integral domain","level":3,"score":0.4345620572566986},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4207048714160919},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.3007281422615051},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2655808925628662},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2638895809650421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24091356992721558},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.14723315834999084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10132274031639099},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-2017-0024","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2017-0024","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-2/The-Complexity-of-Primes-in-Computable-Unique-Factorization-Domains/10.1215/00294527-2017-0024.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1407.2626","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.2626","pdf_url":"https://arxiv.org/pdf/1407.2626","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1519722286","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1519722286","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1215/00294527-2017-0024","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2017-0024","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-2/The-Complexity-of-Primes-in-Computable-Unique-Factorization-Domains/10.1215/00294527-2017-0024.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1937825932.pdf","grobid_xml":"https://content.openalex.org/works/W1937825932.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1495410784","https://openalex.org/W1496801598","https://openalex.org/W1509364989","https://openalex.org/W1522998756","https://openalex.org/W1524694507","https://openalex.org/W1548944036","https://openalex.org/W1590434062","https://openalex.org/W1602220947","https://openalex.org/W1984002375","https://openalex.org/W1986415410","https://openalex.org/W2010770007","https://openalex.org/W2027628811","https://openalex.org/W2029691756","https://openalex.org/W2056414301","https://openalex.org/W2058179628","https://openalex.org/W2059568104","https://openalex.org/W2063706894","https://openalex.org/W2066029033","https://openalex.org/W2074803653","https://openalex.org/W2489377303","https://openalex.org/W4232277851","https://openalex.org/W4242679002","https://openalex.org/W4249549360"],"related_works":["https://openalex.org/W4239453361","https://openalex.org/W197714092","https://openalex.org/W1994403863","https://openalex.org/W2150482238","https://openalex.org/W2527631632","https://openalex.org/W1577501449","https://openalex.org/W153068418","https://openalex.org/W2031295477","https://openalex.org/W2108904240","https://openalex.org/W1937825932"],"abstract_inverted_index":{"In":[0,76],"many":[1,31],"simple":[2],"integral":[3,47],"domains,":[4],"such":[5,38,87,121],"as":[6],"Z":[7,85],"or":[8,51],"Z[i],":[9],"there":[10,61],"is":[11,20,127],"a":[12,26,39,88,108,115],"straightforward":[13],"procedure":[14],"to":[15,25,46,68,82],"determine":[16,69],"if":[17],"an":[18,57],"element":[19],"prime":[21,71],"by":[22],"simply":[23],"reducing":[24],"direct":[27],"check":[28],"of":[29,54,114,125],"finitely":[30],"potential":[32],"divisors.":[33],"Despite":[34],"the":[35,52,70,94,112,123],"fact":[36],"that":[37,66,90,122],"naive":[40],"approach":[41],"does":[42],"not":[43],"immediately":[44],"translate":[45],"domains":[48],"like":[49],"Z[x]":[50],"ring":[53],"integers":[55],"in":[56,73,86,98,129],"algebraic":[58],"number":[59],"field,":[60],"still":[62],"exist":[63],"computational":[64],"procedures":[65],"work":[67],"elements":[72],"these":[74],"cases.":[75],"contrast,":[77],"we":[78,91,110],"will":[79],"show":[80],"how":[81],"computably":[83],"extend":[84],"way":[89],"can":[92],"control":[93],"ordinary":[95],"integer":[96],"primes":[97,126],"any":[99],"\u03a020":[100],"way,":[101],"all":[102],"while":[103],"maintaining":[104],"unique":[105,117],"factorization.":[106],"As":[107],"corollary,":[109],"establish":[111],"existence":[113],"computable":[116,131],"factorization":[118],"domain":[119],"(UFD)":[120],"set":[124],"\u03a020-complete":[128],"every":[130],"presentation.":[132]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}