{"id":"https://openalex.org/W2169281719","doi":"https://doi.org/10.1002/malq.19950410408","title":"Relatively Recursively Enumerable Versus Relatively \u03a3<sub>1</sub>in Models of Peano Arithmetic","display_name":"Relatively Recursively Enumerable Versus Relatively \u03a3<sub>1</sub>in Models of Peano Arithmetic","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2169281719","doi":"https://doi.org/10.1002/malq.19950410408","mag":"2169281719"},"language":"en","primary_location":{"id":"doi:10.1002/malq.19950410408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19950410408","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","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/A5009745982","display_name":"Grzegorz Michalski","orcid":"https://orcid.org/0000-0002-8211-4057"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]},{"id":"https://openalex.org/I4210154633","display_name":"Inspiration Innovation Synergy University","ror":"https://ror.org/04d3d5q14","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210154633"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"Grzegorz Michalski","raw_affiliation_strings":["Department of Mathematics, University of Notre Dame Notre Dame, Indiana 46556, US.A","The author wishes to thank J ULIA K NIGHT - his thesis supervisor for much inspiring advice","The author wishes to thank JULIA KNIGHT - his thesis supervisor for much inspiring advice"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Notre Dame Notre Dame, Indiana 46556, US.A","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"The author wishes to thank J ULIA K NIGHT - his thesis supervisor for much inspiring advice","institution_ids":["https://openalex.org/I4210154633"]},{"raw_affiliation_string":"The author wishes to thank JULIA KNIGHT - his thesis supervisor for much inspiring advice","institution_ids":["https://openalex.org/I4210154633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009745982"],"corresponding_institution_ids":["https://openalex.org/I107639228","https://openalex.org/I4210154633"],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25353176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"4","first_page":"515","last_page":"522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9965000152587891,"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.9962999820709229,"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.9520541429519653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8969045877456665},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.8255957365036011},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.805190920829773},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6142188906669617},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5521178245544434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4906655550003052},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4447821378707886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34871578216552734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06095212697982788}],"concepts":[{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.9520541429519653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8969045877456665},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8255957365036011},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.805190920829773},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6142188906669617},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5521178245544434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4906655550003052},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4447821378707886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34871578216552734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06095212697982788},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/malq.19950410408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19950410408","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Zero hunger","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W133492207","https://openalex.org/W159724961","https://openalex.org/W1572451808","https://openalex.org/W1579073671","https://openalex.org/W1601654835","https://openalex.org/W2017254147","https://openalex.org/W2054770471","https://openalex.org/W2233217370","https://openalex.org/W4237559355"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W2094468224","https://openalex.org/W2757989085","https://openalex.org/W4249600134","https://openalex.org/W2169281719","https://openalex.org/W2039379005","https://openalex.org/W2227416782"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"show":[2],"that":[3,4,20],"every":[5],"countable":[6],"model":[7],"of":[8],"PA":[9],"has":[10],"a":[11,16,21,31],"conservative":[12],"extension":[13],"M":[14,30],"with":[15],"subset":[17,32],"Y":[18,26,40],"such":[19],"certain":[22],"\u03a3":[23],"1":[24],"(":[25],")\u2010formula":[27],"defines":[28],"in":[29],"which":[33],"is":[34],"not":[35],"r.":[36],"e.":[37],"relative":[38],"to":[39],".":[41]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}