{"id":"https://openalex.org/W2953242346","doi":"https://doi.org/10.2168/lmcs-3(2:7)2007","title":"The Complexity of Model Checking Higher-Order Fixpoint Logic","display_name":"The Complexity of Model Checking Higher-Order Fixpoint Logic","publication_year":2007,"publication_date":"2007-06-29","ids":{"openalex":"https://openalex.org/W2953242346","doi":"https://doi.org/10.2168/lmcs-3(2:7)2007","mag":"2953242346"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-3(2:7)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:7)2007","pdf_url":"https://lmcs.episciences.org/754/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/754/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Roland Axelsson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roland Axelsson","raw_affiliation_strings":["Department of Computer Science, University of Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Munich, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Martin Lange","orcid":"https://orcid.org/0000-0002-1621-0972"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Lange","raw_affiliation_strings":["Department of Computer Science, University of Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1621-0972","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rafal Somla","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Rafal Somla","raw_affiliation_strings":["IT Department, Uppsala University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT Department, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4844,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.79824726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 3, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.453900009393692,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.453900009393692,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.30649998784065247,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.20020000636577606,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/arity","display_name":"Arity","score":0.7666000127792358},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6998999714851379},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5914999842643738},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5863000154495239},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.48730000853538513},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4839000105857849},{"id":"https://openalex.org/keywords/partial-order-reduction","display_name":"Partial order reduction","score":0.48010000586509705},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.43939998745918274},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4196999967098236},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.3959999978542328}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.7666000127792358},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6998999714851379},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5914999842643738},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5863000154495239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5315999984741211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4936999976634979},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.48730000853538513},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.48010000586509705},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.43939998745918274},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4196999967098236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4156000018119812},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.3898000121116638},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3797999918460846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.3418999910354614},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.32359999418258667},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.32260000705718994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31790000200271606},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.30480000376701355},{"id":"https://openalex.org/C49016629","wikidata":"https://www.wikidata.org/wiki/Q3075235","display_name":"Double exponential function","level":3,"score":0.2994000017642975},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.2851000130176544},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.2752000093460083},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.271699994802475},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.2671999931335449},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-3(2:7)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:7)2007","pdf_url":"https://lmcs.episciences.org/754/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0704.3931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0704.3931","pdf_url":"https://arxiv.org/pdf/0704.3931","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:f85b82d1602f4a7fb67801ab32c080e3","is_oa":true,"landing_page_url":"https://doaj.org/article/f85b82d1602f4a7fb67801ab32c080e3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 3, Issue 2 (2007)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-3(2:7)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:7)2007","pdf_url":"https://lmcs.episciences.org/754/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2953242346.pdf","grobid_xml":"https://content.openalex.org/works/W2953242346.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W260642817","https://openalex.org/W1508106431","https://openalex.org/W1536658706","https://openalex.org/W1987290139","https://openalex.org/W2045427966","https://openalex.org/W2053068495","https://openalex.org/W2062879749","https://openalex.org/W2069709605","https://openalex.org/W2117221156","https://openalex.org/W2121025472","https://openalex.org/W2121147545","https://openalex.org/W2142133061","https://openalex.org/W2163380748","https://openalex.org/W6665773200","https://openalex.org/W6822517396","https://openalex.org/W6941226251","https://openalex.org/W7028570583"],"related_works":[],"abstract_inverted_index":{"Higher-Order":[0],"Fixpoint":[1],"Logic":[2],"(HFL)":[3],"is":[4,25,148],"a":[5,19,127,151,188,210],"hybrid":[6],"of":[7,27,33,59,66,103,112,141,170,198,201],"the":[8,13,40,86,101,104,110,113,138,154,195],"simply":[9],"typed":[10],"\\lambda-calculus":[11],"and":[12,70,106],"modal":[14,41],"\\lambda-calculus.":[15,42],"This":[16,43,207],"makes":[17],"it":[18],"highly":[20],"expressive":[21,214],"temporal":[22],"logic":[23],"that":[24,35,97,171],"capable":[26],"expressing":[28],"various":[29],"interesting":[30],"correctness":[31],"properties":[32],"programs":[34],"are":[36,98,167,176],"not":[37],"expressible":[38],"in":[39,100,109,122,213],"paper":[44],"provides":[45],"complexity":[46,140,197],"results":[47],"for":[48,79,157,194],"its":[49],"model":[50,80],"checking":[51,81],"problem.":[52],"In":[53],"particular":[54],"we":[55,89,130,185],"consider":[56],"those":[57],"fragments":[58,200],"HFL":[60],"built":[61],"by":[62,150],"using":[63],"only":[64],"types":[65],"bounded":[67,162],"order":[68],"k":[69],"arity":[71],"m.":[72],"We":[73],"establish":[74],"k-fold":[75,107,182,190],"exponential":[76,108,133,160,183,191],"time":[77,134,192],"completeness":[78,193],"each":[82,142],"such":[83,143],"fragment.":[84,144],"For":[85],"upper":[87,135],"bound":[88,136,147],"use":[90],"fixpoint":[91],"elimination":[92],"to":[93,181],"obtain":[94,131],"reachability":[95],"games":[96,118],"singly-exponential":[99],"size":[102,111],"formula":[105],"underlying":[114],"transition":[115],"system.":[116],"These":[117],"can":[119],"be":[120],"solved":[121],"deterministic":[123],"linear":[124],"time.":[125],"As":[126],"simple":[128],"consequence,":[129],"an":[132],"on":[137],"expression":[139],"The":[145],"lower":[146],"established":[149],"reduction":[152],"from":[153],"word":[155,174],"problem":[156],"alternating":[158],"(k-1)-fold":[159],"space":[161],"Turing":[163],"Machines.":[164],"Since":[165],"there":[166],"fixed":[168],"machines":[169],"type":[172],"whose":[173],"problems":[175],"already":[177],"hard":[178],"with":[179],"respect":[180],"time,":[184],"obtain,":[186],"as":[187],"corollary,":[189],"data":[196],"our":[199],"HFL,":[202],"provided":[203],"m":[204],"exceeds":[205],"3.":[206],"also":[208],"yields":[209],"hierarchy":[211],"result":[212],"power.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-06-27T00:00:00"}