{"id":"https://openalex.org/W2030664340","doi":"https://doi.org/10.2307/2275673","title":"Definability and decidability issues in extensions of the integers with the divisibility predicate","display_name":"Definability and decidability issues in extensions of the integers with the divisibility predicate","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2030664340","doi":"https://doi.org/10.2307/2275673","mag":"2030664340"},"language":"en","primary_location":{"id":"doi:10.2307/2275673","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275673","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037280340","display_name":"Patrick C\u00e9gielski","orcid":null},"institutions":[{"id":"https://openalex.org/I102272798","display_name":"INSEAD","ror":"https://ror.org/00ghzk478","country_code":"FR","type":"education","lineage":["https://openalex.org/I102272798"]},{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Patrick Cegielski","raw_affiliation_strings":["L.I.T.P., I.B.P., U.R.A. 248, Universit\u00e9 Paris XII, I.U.T de Fontainebleau, Route Hurtault, F-77300 Fontainebleau, France, E-mail:","universit\u00e9 Paris XII"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L.I.T.P., I.B.P., U.R.A. 248, Universit\u00e9 Paris XII, I.U.T de Fontainebleau, Route Hurtault, F-77300 Fontainebleau, France, E-mail:","institution_ids":["https://openalex.org/I102272798","https://openalex.org/I197681013"]},{"raw_affiliation_string":"universit\u00e9 Paris XII","institution_ids":["https://openalex.org/I197681013","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053052255","display_name":"Yuri Matiyasevich","orcid":"https://orcid.org/0000-0001-7046-3746"},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Yuri Matiyasevich","raw_affiliation_strings":["Steklov Institute of Mathematics, 27 Fontanka, Saint-Petersbourg, 191011, Russie, E-mail:","Steklov Inst. of Mathematics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics, 27 Fontanka, Saint-Petersbourg, 191011, Russie, E-mail:","institution_ids":["https://openalex.org/I2801160905"]},{"raw_affiliation_string":"Steklov Inst. of Mathematics","institution_ids":["https://openalex.org/I2801160905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012238821","display_name":"Denis Richard","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Denis Richard","raw_affiliation_strings":["Laboratoire de Logique, Algorithmique, et Informatique de Clermont i (LLAIC 1), I.U.T. Informatique, B.P. 86, F-63172 Aubi\u00e8re Cedex, France, E-mail:","Laboratoire de Logique, Algorithmique, et Informatique de Clermont i (LLAIC 1), I.U.T. Informatique, B.P. 86, F-63172 Aubi\u00e8re Cedex, France, E-mail: richard@llaic.univ-bpclermont.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Logique, Algorithmique, et Informatique de Clermont i (LLAIC 1), I.U.T. Informatique, B.P. 86, F-63172 Aubi\u00e8re Cedex, France, E-mail:","institution_ids":["https://openalex.org/I4210115519"]},{"raw_affiliation_string":"Laboratoire de Logique, Algorithmique, et Informatique de Clermont i (LLAIC 1), I.U.T. Informatique, B.P. 86, F-63172 Aubi\u00e8re Cedex, France, E-mail: richard@llaic.univ-bpclermont.fr","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":1.475,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82061526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"61","issue":"2","first_page":"515","last_page":"540"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divisibility-rule","display_name":"Divisibility rule","score":0.8934931755065918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8304927349090576},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6613331437110901},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.630291223526001},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5675464868545532},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5557613372802734},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4694965183734894},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4236077666282654},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.41459351778030396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07152381539344788}],"concepts":[{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.8934931755065918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8304927349090576},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6613331437110901},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.630291223526001},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5675464868545532},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5557613372802734},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4694965183734894},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4236077666282654},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.41459351778030396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07152381539344788},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2275673","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275673","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W640277993","https://openalex.org/W1494497985","https://openalex.org/W1970961429","https://openalex.org/W1975790950","https://openalex.org/W1976331238","https://openalex.org/W1984820433","https://openalex.org/W2015376829","https://openalex.org/W2028815567","https://openalex.org/W2063770561","https://openalex.org/W2076691615","https://openalex.org/W2078092186","https://openalex.org/W2095419501","https://openalex.org/W2231843957","https://openalex.org/W2282945442","https://openalex.org/W2312565172","https://openalex.org/W2467882161","https://openalex.org/W2480761287","https://openalex.org/W2481585664","https://openalex.org/W2954327716","https://openalex.org/W2989708882","https://openalex.org/W3037175162","https://openalex.org/W3110765098","https://openalex.org/W3128307576","https://openalex.org/W4243643814","https://openalex.org/W4285719527","https://openalex.org/W6644451857","https://openalex.org/W6719156289","https://openalex.org/W6719891014","https://openalex.org/W6721267217"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2170336571","https://openalex.org/W2020140696"],"abstract_inverted_index":{"Abstract":[0],"Let":[1,22,36],"be":[2,24,40],"a":[3,190,200],"first-order":[4,15],"structure;":[5],"we":[6],"denote":[7],"by":[8,154],"DEF(":[9],")":[10],"the":[11,31,42,52,70,144,156,160,164,172,176,180,183],"set":[12,32,71],"of":[13,33,125,137,159,163,167,171,175,179,182,194,207],"all":[14,89],"definable":[16,142],"relations":[17],"and":[18,38,45,57,96,116,170],"functions":[19],"within":[20,143],".":[21],"\u03c0":[23,67,103],"any":[25],"one-to-one":[26],"function":[27,66],"from":[28],"\u2115":[29],"into":[30],"prime":[34,138],"integers.":[35,149],"\u2223":[37],"\u2022":[39],"respectively":[41],"divisibility":[43,145],"relation":[44,124],"multiplication":[46],"as":[47],"function.":[48],"We":[49,150],"show":[50],"that":[51,69,132],"sets":[53],"DEF(\u2115,":[54,58,72,77,84],"\u03c0,":[55,59,78,114,118],"\u2223)":[56,115],"\u2022)":[60,79,119],"are":[61,120],"equal.":[62],"However":[63],"there":[64,91],"exists":[65],"such":[68],"+,":[73,85,109],"\u2223),":[74],"or,":[75],"equivalently,":[76],"is":[80,92,105,140],"not":[81,141],"equal":[82,135],"to":[83,107,204],"\u2022).":[86],"Nevertheless,":[87],"in":[88],"cases":[90],"an":[93,205],"{\u03c0,":[94,99],"\u2022}-definable":[95],"hence":[97],"also":[98],"|}-definable":[100],"structure":[101],"over":[102,147],"which":[104],"isomorphic":[106],"\u3008\u2115,":[108],"\u2022\u3009.":[110],"Hence":[111],"theories":[112],"TH(\u2115,":[113,117],"undecidable.":[121],"The":[122,186],"binary":[123],"equipotence":[126],"between":[127],"two":[128],"positive":[129,148,168],"integers":[130,169],"saying":[131],"they":[133],"have":[134],"number":[136],"divisors":[139],"lattice":[146],"prove":[151],"it":[152],"first":[153],"comparing":[155],"lower":[157],"bound":[158,174],"computational":[161,177],"complexity":[162,178],"additive":[165],"theory":[166,181],"upper":[173],"mentioned":[184],"lattice.":[185],"last":[187],"section":[188],"provides":[189],"self-contained":[191],"alternative":[192],"proof":[193],"this":[195],"latter":[196],"result":[197],"based":[198],"on":[199],"decision":[201],"method":[202],"linked":[203],"elimination":[206],"quantifiers":[208],"via":[209],"specific":[210],"tables.":[211]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}