{"id":"https://openalex.org/W2090746463","doi":"https://doi.org/10.1305/ndjfl/1040136913","title":"Four Problems Concerning Recursively Saturated Models of Arithmetic","display_name":"Four Problems Concerning Recursively Saturated Models of Arithmetic","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2090746463","doi":"https://doi.org/10.1305/ndjfl/1040136913","mag":"2090746463"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1040136913","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040136913","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-4/Four-Problems-Concerning-Recursively-Saturated-Models-of-Arithmetic/10.1305/ndjfl/1040136913.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":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-4/Four-Problems-Concerning-Recursively-Saturated-Models-of-Arithmetic/10.1305/ndjfl/1040136913.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030170691","display_name":"Roman Kossak","orcid":"https://orcid.org/0000-0002-8475-5747"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Roman Kossak","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030170691"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6257,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83955003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9973000288009644,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9965000152587891,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9933000206947327,"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/converse","display_name":"Converse","score":0.8963079452514648},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.768676221370697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6983163952827454},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.6382145285606384},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5127230882644653},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.4957595765590668},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.49455782771110535},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.42394959926605225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4176439642906189},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.326351523399353},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.08604639768600464},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.05548146367073059}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8963079452514648},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.768676221370697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6983163952827454},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.6382145285606384},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5127230882644653},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.4957595765590668},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.49455782771110535},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.42394959926605225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4176439642906189},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.326351523399353},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.08604639768600464},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.05548146367073059},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1040136913","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040136913","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-4/Four-Problems-Concerning-Recursively-Saturated-Models-of-Arithmetic/10.1305/ndjfl/1040136913.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:CULeuclid:euclid.ndjfl/1040136913","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1040136913","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.1305/ndjfl/1040136913","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040136913","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-4/Four-Problems-Concerning-Recursively-Saturated-Models-of-Arithmetic/10.1305/ndjfl/1040136913.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":[{"display_name":"Decent work and economic growth","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2090746463.pdf","grobid_xml":"https://content.openalex.org/works/W2090746463.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W83512845","https://openalex.org/W943283237","https://openalex.org/W1601654835","https://openalex.org/W1969475731","https://openalex.org/W1972467963","https://openalex.org/W1980789512","https://openalex.org/W2047169696","https://openalex.org/W2051085539","https://openalex.org/W2054770471","https://openalex.org/W2055731527","https://openalex.org/W2062971733","https://openalex.org/W2118526818","https://openalex.org/W2573016414"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2391769344","https://openalex.org/W4297790016","https://openalex.org/W2359260952","https://openalex.org/W2119609861","https://openalex.org/W4226437520","https://openalex.org/W4287029620"],"abstract_inverted_index":{"The":[0,23,29],"paper":[1],"presents":[2],"four":[3],"open":[4],"problems.":[5],"One":[6],"concerns":[7],"a":[8,20,54],"possible":[9],"converse":[10],"to":[11],"Tarski's":[12],"undefinability":[13],"of":[14,19,39,44,49,66],"truth":[15],"theorem,":[16],"and":[17,46],"is":[18,57],"general":[21],"character.":[22],"other":[24],"three":[25],"are":[26,31,62],"more":[27],"specific.":[28],"questions":[30],"about":[32,47],"some":[33],"special":[34],"$\\omega_1$-like":[35],"models,":[36],"initial":[37],"segments":[38],"countable":[40],"recursively":[41],"saturated":[42],"models":[43],"PA,":[45],"extendability":[48],"automorphisms.":[50],"In":[51],"each":[52],"case":[53],"partial":[55,60],"answer":[56],"given.":[58],"All":[59],"solutions":[61],"based":[63],"on":[64],"applications":[65],"inductive":[67],"satisfaction":[68],"classes.":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}