{"id":"https://openalex.org/W1996601395","doi":"https://doi.org/10.2178/jsl/1190150103","title":"On orbits, of prompt and low computably enumerable sets","display_name":"On orbits, of prompt and low computably enumerable sets","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W1996601395","doi":"https://doi.org/10.2178/jsl/1190150103","mag":"1996601395"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1190150103","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150103","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/A5054398123","display_name":"Kevin Wald","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kevin Wald","raw_affiliation_strings":["Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269-3009, USA, E-mail:","University of Connecticut"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269-3009, USA, E-mail:","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"University of Connecticut","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054398123"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.782,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71326941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"67","issue":"2","first_page":"649","last_page":"678"},"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.9898999929428101,"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.9825999736785889,"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/automorphism","display_name":"Automorphism","score":0.9482912421226501},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7978453636169434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7602137327194214},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.7196251749992371},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6471956968307495},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5076109170913696},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.48160502314567566},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4643464684486389},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.44482430815696716},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.44185811281204224},{"id":"https://openalex.org/keywords/automorphisms-of-the-symmetric-and-alternating-groups","display_name":"Automorphisms of the symmetric and alternating groups","score":0.42044597864151},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40450677275657654},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.3703910708427429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1830122470855713},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06081792712211609},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.04679855704307556}],"concepts":[{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.9482912421226501},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7978453636169434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7602137327194214},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.7196251749992371},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6471956968307495},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5076109170913696},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.48160502314567566},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4643464684486389},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.44482430815696716},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.44185811281204224},{"id":"https://openalex.org/C162619202","wikidata":"https://www.wikidata.org/wiki/Q4826703","display_name":"Automorphisms of the symmetric and alternating groups","level":3,"score":0.42044597864151},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40450677275657654},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.3703910708427429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1830122470855713},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06081792712211609},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.04679855704307556},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl/1190150103","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150103","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/1190150103","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1190150103","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":11,"referenced_works":["https://openalex.org/W1510551874","https://openalex.org/W1972481159","https://openalex.org/W1974073829","https://openalex.org/W1987574007","https://openalex.org/W1996663206","https://openalex.org/W2000779724","https://openalex.org/W2005402036","https://openalex.org/W2037469541","https://openalex.org/W2045033949","https://openalex.org/W2315181607","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W1973052363","https://openalex.org/W2000487993","https://openalex.org/W2094468224","https://openalex.org/W1980641386","https://openalex.org/W2132512348","https://openalex.org/W2089792255","https://openalex.org/W2135152748","https://openalex.org/W4249600134"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"concerns":[3],"automorphisms":[4,104],"of":[5,23,31,41,74,78,81,93,97,102],"the":[6,39,75,79,100],"computably":[7],"enumerable":[8],"sets.":[9],"We":[10,35],"prove":[11],"two":[12],"results":[13],"relating":[14],"semilow":[15],"sets":[16],"and":[17,33,49,83],"prompt":[18],"degrees":[19],"via":[20],"automorphisms,":[21],"one":[22],"which":[24],"is":[25,44,57,71],"complementary":[26],"to":[27,59,105],"a":[28,72,94],"recent":[29,95],"result":[30,96],"Downey":[32],"Harrington.":[34],"also":[36],"show":[37],"that":[38,50],"property":[40],"effective":[42],"simplicity":[43],"not":[45],"invariant":[46],"under":[47],"automorphism,":[48],"in":[51,68],"fact":[52],"every":[53],"promptly":[54],"simple":[55,62],"set":[56],"automorphic":[58],"an":[60],"effectively":[61],"set.":[63],"A":[64],"major":[65],"technique":[66],"used":[67],"these":[69],"proofs":[70],"modification":[73,90],"Harrington-Soare":[76,82],"version":[77],"method":[80],"Cholak":[84],"for":[85],"constructing":[86],"\u039430":[87],"automorphisms;":[88],"this":[89],"takes":[91],"advantage":[92],"Soare":[98],"on":[99],"extension":[101],"\u201crestricted\u201d":[103],"full":[106],"automorphisms.":[107]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}