{"id":"https://openalex.org/W1982652937","doi":"https://doi.org/10.2307/2275877","title":"The undecidability of the \u03a0<sub>4</sub>-theory for the r.e. wtt and Turing degrees","display_name":"The undecidability of the \u03a0<sub>4</sub>-theory for the r.e. wtt and Turing degrees","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1982652937","doi":"https://doi.org/10.2307/2275877","mag":"1982652937"},"language":"en","primary_location":{"id":"doi:10.2307/2275877","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275877","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/A5032435178","display_name":"Steffen Lempp","orcid":"https://orcid.org/0000-0002-2958-4017"},"institutions":[{"id":"https://openalex.org/I1304256225","display_name":"University of Wisconsin System","ror":"https://ror.org/03ydkyb10","country_code":"US","type":"education","lineage":["https://openalex.org/I1304256225"]},{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steffen Lempp","raw_affiliation_strings":["Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706, E-mail:","University of Wisconsin \u2013,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706, E-mail:","institution_ids":["https://openalex.org/I1304256225","https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin \u2013,","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047690936","display_name":"Andr\u00e9 Nies","orcid":"https://orcid.org/0000-0002-0666-5180"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nies","raw_affiliation_strings":["Department of Mathematics, University of Chicago, Chicago, Illinois 60637","University-of Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Chicago, Chicago, Illinois 60637","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University-of Chicago","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0561,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.73207711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"60","issue":"4","first_page":"1118","last_page":"1136"},"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/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9959999918937683,"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/undecidable-problem","display_name":"Undecidable problem","score":0.9208980202674866},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.8120338916778564},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.6723499894142151},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.6617444157600403},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5815150141716003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5622924566268921},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5304054021835327},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4877984821796417},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4676347076892853},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.4599437415599823},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4224681258201599},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38665398955345154},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.35536932945251465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3108592629432678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2105528712272644},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.19577568769454956},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11771693825721741},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06920760869979858}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9208980202674866},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8120338916778564},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.6723499894142151},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.6617444157600403},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5815150141716003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5622924566268921},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5304054021835327},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4877984821796417},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4676347076892853},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.4599437415599823},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4224681258201599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38665398955345154},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.35536932945251465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3108592629432678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2105528712272644},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.19577568769454956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11771693825721741},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06920760869979858},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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":1,"locations":[{"id":"doi:10.2307/2275877","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275877","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W44015752","https://openalex.org/W1964249676","https://openalex.org/W1996842106","https://openalex.org/W2006726677","https://openalex.org/W2010076006","https://openalex.org/W2030147904","https://openalex.org/W2038443311","https://openalex.org/W2083442865","https://openalex.org/W2500837594"],"related_works":["https://openalex.org/W2739700767","https://openalex.org/W1604909338","https://openalex.org/W2484712192","https://openalex.org/W2089947806","https://openalex.org/W2024250534","https://openalex.org/W584827857","https://openalex.org/W55259022","https://openalex.org/W2744680628","https://openalex.org/W1924424002","https://openalex.org/W2064907739"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"show":[2],"that":[3],"the":[4,9,26,45],"\u03a0":[5],"4":[6],"-theory":[7],"of":[8,12,25,47],"partial":[10],"order":[11],"recursively":[13],"enumerable":[14],"weak":[15],"truth-table":[16],"degrees":[17],"is":[18,33],"undecidable,":[19],"and":[20],"give":[21],"a":[22,37],"new":[23,38],"proof":[24],"similar":[27],"fact":[28],"for":[29],"r.e.":[30],"T-degrees.":[31],"This":[32],"accomplished":[34],"by":[35],"introducing":[36],"coding":[39],"scheme":[40],"which":[41],"consists":[42],"in":[43],"defining":[44],"class":[46],"finite":[48],"bipartite":[49],"graphs":[50],"with":[51],"parameters.":[52]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}