{"id":"https://openalex.org/W2099293911","doi":"https://doi.org/10.2307/2273150","title":"On the complexity of models of arithmetic","display_name":"On the complexity of models of arithmetic","publication_year":1982,"publication_date":"1982-06-01","ids":{"openalex":"https://openalex.org/W2099293911","doi":"https://doi.org/10.2307/2273150","mag":"2099293911"},"language":"en","primary_location":{"id":"doi:10.2307/2273150","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273150","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/A5076131942","display_name":"Kenneth McAloon","orcid":null},"institutions":[{"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":true,"raw_author_name":"Kenneth McAloon","raw_affiliation_strings":["U.E.R. de Mathematiques, Universite Paris VII, Paris, France","U. E. R. de Math\u00e9matiques, Universit\u00e9 Paris VII, Paris, France"],"affiliations":[{"raw_affiliation_string":"U.E.R. de Mathematiques, Universite Paris VII, Paris, France","institution_ids":["https://openalex.org/I204730241"]},{"raw_affiliation_string":"U. E. R. de Math\u00e9matiques, Universit\u00e9 Paris VII, Paris, France","institution_ids":["https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076131942"],"corresponding_institution_ids":["https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":1.6489,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.85102812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"47","issue":"2","first_page":"403","last_page":"415"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.9279425144195557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7093501091003418},{"id":"https://openalex.org/keywords/second-order-arithmetic","display_name":"Second-order arithmetic","score":0.6908228993415833},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5969979166984558},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5479552149772644},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5393481254577637},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5349892973899841},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.48545199632644653},{"id":"https://openalex.org/keywords/transfinite-number","display_name":"Transfinite number","score":0.45475447177886963},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42649561166763306},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.4145805537700653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32391998171806335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13300469517707825}],"concepts":[{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.9279425144195557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7093501091003418},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.6908228993415833},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5969979166984558},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5479552149772644},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5393481254577637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5349892973899841},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.48545199632644653},{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.45475447177886963},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42649561166763306},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.4145805537700653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32391998171806335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13300469517707825},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2273150","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273150","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"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183741006","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183741006","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W6754198","https://openalex.org/W44126761","https://openalex.org/W83512845","https://openalex.org/W103297058","https://openalex.org/W182686285","https://openalex.org/W1602067282","https://openalex.org/W2005638249","https://openalex.org/W2017019103","https://openalex.org/W2037709165","https://openalex.org/W2188630266","https://openalex.org/W2202357257","https://openalex.org/W2285371954","https://openalex.org/W2480761287","https://openalex.org/W2492264453","https://openalex.org/W2498473121","https://openalex.org/W2530006810","https://openalex.org/W2905135108","https://openalex.org/W2969873114","https://openalex.org/W4291439952"],"related_works":["https://openalex.org/W4255069280","https://openalex.org/W4235932242","https://openalex.org/W2025460262","https://openalex.org/W1537958706","https://openalex.org/W4311117965","https://openalex.org/W3037940532","https://openalex.org/W4226435082","https://openalex.org/W2101785868","https://openalex.org/W2008203175","https://openalex.org/W4300430427"],"abstract_inverted_index":{"Abstract":[0],"Let":[1,18,37],"P":[2,26],"0":[3,27],"be":[4,20,33,39],"the":[5,34,55,76,86,94,97],"subsystem":[6],"of":[7,25,44,48,66,72,79,89,99],"Peano":[8,45],"arithmetic":[9,46],"obtained":[10],"by":[11],"restricting":[12],"induction":[13],"to":[14,32,85],"bounded":[15],"quantifier":[16],"formulas.":[17],"M":[19,64,67,80,90,100],"a":[21,40,70],"countable,":[22],"nonstandard":[23],"model":[24,71],"whose":[28,49],"domain":[29],"we":[30],"suppose":[31],"standard":[35,56],"integers.":[36],"T":[38,73],"recursively":[41],"enumerable":[42],"extension":[43],"all":[47],"existential":[50],"consequences":[51],"are":[52],"satisfied":[53],"in":[54],"model.":[57],"Then":[58],"there":[59],"is":[60,69,82,101],"an":[61],"initial":[62],"segment":[63],"\u2032":[65,81],"which":[68],"such":[74],"that":[75],"complete":[77],"diagram":[78,88],"Turing":[83],"reducible":[84],"atomic":[87],".":[91],"Moreover,":[92],"neither":[93],"addition":[95],"nor":[96],"multiplication":[98],"recursive.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}