{"id":"https://openalex.org/W2073028890","doi":"https://doi.org/10.1002/malq.19980440108","title":"Capturing Relativized Complexity Classes without Order","display_name":"Capturing Relativized Complexity Classes without Order","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2073028890","doi":"https://doi.org/10.1002/malq.19980440108","mag":"2073028890"},"language":"en","primary_location":{"id":"doi:10.1002/malq.19980440108","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19980440108","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0942-5616","issn":["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/A5080843415","display_name":"Anuj Dawar","orcid":"https://orcid.org/0000-0003-4014-8248"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anuj Dawar","raw_affiliation_strings":["Department of Computer Science, University of Wales, Swansea SA2 8PP, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wales, Swansea SA2 8PP, U.K","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Department of Information Systems, TU Wien, Paniglgasse 16, A-1040 Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems, TU Wien, Paniglgasse 16, A-1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078573449","display_name":"Lauri Hella","orcid":"https://orcid.org/0000-0002-9117-8124"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Lauri Hella","raw_affiliation_strings":["Department of Mathematics, P.O. Box 4 (Yliopistonkatu 5) 00014 University of Helsinki, Finland","We would like to thank Sarah Mocas for helpful discussions concerning the Boolean hierarchy over NEXPTIME and for making her thesis and her papers available. We also thank Harry Buhrman, Lane Hemaspaandra, and Steve Homer for clarifications concerning exponential complexity classes"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, P.O. Box 4 (Yliopistonkatu 5) 00014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"We would like to thank Sarah Mocas for helpful discussions concerning the Boolean hierarchy over NEXPTIME and for making her thesis and her papers available. We also thank Harry Buhrman, Lane Hemaspaandra, and Steve Homer for clarifications concerning exponential complexity classes","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080843415"],"corresponding_institution_ids":[],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":1.0169,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.77185353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"44","issue":"1","first_page":"109","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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/p","display_name":"P","score":0.9362189769744873},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7303473353385925},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6714829802513123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6603625416755676},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.580299973487854},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49563395977020264},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.487705796957016},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48521092534065247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44445550441741943},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3725794553756714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19251060485839844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14436063170433044}],"concepts":[{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.9362189769744873},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7303473353385925},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6714829802513123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6603625416755676},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.580299973487854},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49563395977020264},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.487705796957016},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48521092534065247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44445550441741943},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3725794553756714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19251060485839844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14436063170433044},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/malq.19980440108","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19980440108","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0942-5616","issn":["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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.7651","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.7651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.helsinki.fi/~hella/DGH.ps","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:144c89ab-ab12-4cea-ba40-7b7c3b577af2","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:144c89ab-ab12-4cea-ba40-7b7c3b577af2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W43155751","https://openalex.org/W100012220","https://openalex.org/W126455252","https://openalex.org/W195504394","https://openalex.org/W1482193060","https://openalex.org/W1543965609","https://openalex.org/W1590283810","https://openalex.org/W1973023438","https://openalex.org/W1986602165","https://openalex.org/W1989783863","https://openalex.org/W1997198079","https://openalex.org/W2015413218","https://openalex.org/W2016610770","https://openalex.org/W2031411912","https://openalex.org/W2042690606","https://openalex.org/W2043360684","https://openalex.org/W2053094807","https://openalex.org/W2058277150","https://openalex.org/W2059144726","https://openalex.org/W2063406522","https://openalex.org/W2080371886","https://openalex.org/W2088094394","https://openalex.org/W2132541147","https://openalex.org/W2149330764","https://openalex.org/W2561675875","https://openalex.org/W3127113455","https://openalex.org/W4244088669"],"related_works":["https://openalex.org/W2290968667","https://openalex.org/W2970311880","https://openalex.org/W2403781283","https://openalex.org/W2399914283","https://openalex.org/W2002952819","https://openalex.org/W3003471035","https://openalex.org/W2173966285","https://openalex.org/W2199053348","https://openalex.org/W2109858088","https://openalex.org/W1956764718"],"abstract_inverted_index":{"Abstract":[0],"We":[1,44,68],"consider":[2,16],"the":[3,17,61],"problem":[4],"of":[5,9,34,63,80],"obtaining":[6],"logical":[7],"characterisations":[8,29,48],"oracle":[10],"complexity":[11,18,66],"classes.":[12],"In":[13],"particular,":[14],"we":[15],"classes":[19],"LOGSPACE":[20,97],"NP":[21,24,35,74,85,98],"and":[22],"PTIME":[23,73],".":[25,99],"For":[26],"these":[27,47],"classes,":[28],"are":[30,49],"known":[31],"in":[32,78],"terms":[33,79],"computable":[36],"Lindstr\u00f6m":[37,81],"quantifiers":[38],"which":[39],"hold":[40],"on":[41],"ordered":[42],"structures.":[43],"show":[45],"that":[46,72],"unlikely":[50],"to":[51,53],"extend":[52],"arbitrary":[54],"(unordered)":[55],"structures,":[56],"since":[57],"this":[58,92],"would":[59],"imply":[60],"collapse":[62],"certain":[64],"exponential":[65],"hierarchies.":[67],"also":[69],"observe,":[70],"however,":[71],"can":[75,93],"be":[76,94],"characterised":[77],"quantifers":[82],"(not":[83],"necessarily":[84],"computable),":[86],"though":[87],"it":[88],"remains":[89],"open":[90],"whether":[91],"done":[95],"for":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}