{"id":"https://openalex.org/W2964138822","doi":"https://doi.org/10.1215/00294527-2018-0009","title":"More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic","display_name":"More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2964138822","doi":"https://doi.org/10.1215/00294527-2018-0009","mag":"2964138822"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2018-0009","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2018-0009","pdf_url":null,"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":["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/A5091663311","display_name":"James H. Schmerl","orcid":"https://orcid.org/0000-0003-0545-8339"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"James H. Schmerl","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091663311"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26126915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"4","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":1.0,"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":1.0,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9934999942779541,"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/peano-axioms","display_name":"Peano axioms","score":0.9678090810775757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.864699125289917},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.8161680698394775},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.6650981307029724},{"id":"https://openalex.org/keywords/second-order-arithmetic","display_name":"Second-order arithmetic","score":0.6278821229934692},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5535356998443604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4789445996284485},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45579323172569275},{"id":"https://openalex.org/keywords/automorphism-group","display_name":"Automorphism group","score":0.4377225637435913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05458003282546997}],"concepts":[{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.9678090810775757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.864699125289917},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.8161680698394775},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.6650981307029724},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.6278821229934692},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5535356998443604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4789445996284485},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45579323172569275},{"id":"https://openalex.org/C2988750069","wikidata":"https://www.wikidata.org/wiki/Q60790315","display_name":"Automorphism group","level":3,"score":0.4377225637435913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05458003282546997},{"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.1215/00294527-2018-0009","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2018-0009","pdf_url":null,"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:CULeuclid:euclid.ndjfl/1538445762","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1538445762","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1997868768","https://openalex.org/W2020603333","https://openalex.org/W2055731527","https://openalex.org/W2076059128","https://openalex.org/W2330233132","https://openalex.org/W2903725294","https://openalex.org/W2962720709"],"related_works":["https://openalex.org/W4255069280","https://openalex.org/W2951195380","https://openalex.org/W87599178","https://openalex.org/W2017398442","https://openalex.org/W1991956515","https://openalex.org/W4206411991","https://openalex.org/W4224937162","https://openalex.org/W2023423328","https://openalex.org/W2003918494","https://openalex.org/W4226437520"],"abstract_inverted_index":{"There":[0],"is":[1],"an":[2],"infinite":[3],"set":[4],"T":[5],"of":[6,9,25],"Turing-equivalent":[7],"completions":[8],"Peano":[10],"Arithmetic":[11],"(PA)":[12],"such":[13],"that":[14],"whenever":[15],"M":[16],"and":[17,27],"N":[18],"are":[19],"nonisomorphic":[20],"countable,":[21],"arithmetically":[22],"saturated":[23],"models":[24],"PA":[26],"Th(M),":[28],"Th(N)\u2208T,":[29],"then":[30],"Aut(M)\u2247Aut(N).":[31]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}