{"id":"https://openalex.org/W2417369165","doi":"https://doi.org/10.1093/logcom/exu066","title":"A note on hereditarily \u03a010- and \u03a310-complete sets of sentences","display_name":"A note on hereditarily \u03a010- and \u03a310-complete sets of sentences","publication_year":2014,"publication_date":"2014-11-18","ids":{"openalex":"https://openalex.org/W2417369165","doi":"https://doi.org/10.1093/logcom/exu066","mag":"2417369165"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exu066","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exu066","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5006401614","display_name":"Stanislav O. Speranski","orcid":"https://orcid.org/0000-0001-6386-5632"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Stanislav O. Speranski","raw_affiliation_strings":["Sobolev Institute of Mathematics, 4 Koptyug ave. and Novosibirsk State University, 2 Pirogova st., 630090 Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, 4 Koptyug ave. and Novosibirsk State University, 2 Pirogova st., 630090 Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210096862","https://openalex.org/I188973947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006401614"],"corresponding_institution_ids":["https://openalex.org/I188973947","https://openalex.org/I4210096862"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.25083878,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"5","first_page":"1729","last_page":"1741"},"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.9987999796867371,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9976999759674072,"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/state","display_name":"State (computer science)","score":0.48834869265556335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4690796732902527},{"id":"https://openalex.org/keywords/library-science","display_name":"Library science","score":0.3891102969646454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3661080002784729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2480173110961914}],"concepts":[{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.48834869265556335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4690796732902527},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.3891102969646454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3661080002784729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2480173110961914}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exu066","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exu066","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:open-archive.highwire.org:logcom:26/5/1729","is_oa":false,"landing_page_url":"http://logcom.oxfordjournals.org/cgi/content/short/26/5/1729","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":[{"score":0.49000000953674316,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1549008998","https://openalex.org/W1972643432","https://openalex.org/W1978292968","https://openalex.org/W1994417212","https://openalex.org/W2025067481","https://openalex.org/W2105505307","https://openalex.org/W2129318326","https://openalex.org/W2146907658","https://openalex.org/W2500837594","https://openalex.org/W2530006810","https://openalex.org/W4206797071","https://openalex.org/W4253795631"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"Many":[0],"important":[1],"achievements":[2],"of":[3,12,20,33,52,70,72,99,116,154,166,178,193,203],"formal":[4],"logic":[5],"have":[6],"been":[7],"concerned":[8],"with":[9,152,200],"the":[10,18,21,28,44,54,80,84,97,164,173,179,191],"discovery":[11],"incomputability\u2014and":[13],"thus":[14],"firmly":[15],"rooted":[16],"in":[17,40,74,190],"undecidability":[19],"halting":[22],"problem":[23],"and":[24,36,62,79,94,187,197],"its":[25],"complement.":[26],"Also,":[27],"latter":[29],"produce":[30],"influental":[31],"examples":[32,189],"<f>$${\\\\Sigma":[34,60,198],"}_{1}^{0}$$</f>-":[35,61,196],"<f>$${\\\\Pi":[37,63,195],"}_{1}^{0}$$</f>-complete":[38],"sets,":[39],"modern":[41],"terminology.":[42],"Changing":[43],"focus":[45],"from":[46],"modelling":[47],"computations":[48],"to":[49,58],"measuring":[50],"complexity":[51,169],"theories,":[53],"article":[55,183],"describes":[56],"how":[57],"obtain":[59],"}_{1}^{0}$$</f>-completeness":[64],"results":[65],"for":[66,124],"a":[67,75,91,112,201],"wide":[68],"range":[69],"fragments":[71],"theories":[73],"very":[76],"uniform":[77],"way,":[78],"reasoning":[81],"will":[82],"employ":[83],"following":[85],"concepts.":[86],"Let":[87],"<f>$$\\\\sigma":[88,102,117],"$$</f>":[89,115,142],"be":[90],"first-order":[92],"signature":[93],"<f>$$Va{l}_{\\\\sigma":[95,132],"}$$</f>":[96],"collection":[98],"all":[100],"valid":[101],"$$</f>-sentences.":[103],"For":[104],"<f>$$\\\\hbox{":[105,120,126,144],"C":[106,121,127,145],"}\\\\in":[107],"\\\\left\\\\{{\\\\Pi":[108],"}_{1}^{0},{\\\\Sigma":[109],"}_{1}^{0}\\\\right\\\\}$$</f>,":[110],"call":[111],"set":[113],"<f>$$\\\\Gamma":[114],"$$</f>-sentences":[118],"<it>hereditarily</it>":[119],"}$$</f><it>-complete</it>":[122],"iff":[123],"any":[125],"}$$</f>-set":[128],"<f>$$\\\\Delta":[129,141],"$$</f>,":[130,139],"whenever":[131],"}\\\\cap":[133],"\\\\Gamma":[134,138],"\\\\subseteq":[135,137],"\\\\Delta":[136],"then":[140],"is":[143],"}$$</f>-complete.":[146],"Both":[147],"notions":[148],"are":[149],"closely":[150],"connected":[151],"that":[153],"being":[155],"hereditarily":[156],"undecidable,":[157],"but":[158],"unlike":[159],"their":[160],"common":[161],"predecessor,":[162],"serve":[163],"purpose":[165],"getting":[167],"computational":[168],"results,":[170],"via":[171],"employing":[172],"two":[174],"most":[175],"fundamental":[176],"levels":[177],"arithmetical":[180],"hierarchy.":[181],"This":[182],"presents":[184],"major":[185],"tools":[186],"main":[188],"study":[192],"hereditary":[194],"}_{1}^{0}$$</f>-completeness,":[199],"discussion":[202],"various":[204],"applications.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}