{"id":"https://openalex.org/W2073491323","doi":"https://doi.org/10.1137/0206033","title":"The Computational Complexity of Provability in Systems of Modal Propositional Logic","display_name":"The Computational Complexity of Provability in Systems of Modal Propositional Logic","publication_year":1977,"publication_date":"1977-09-01","ids":{"openalex":"https://openalex.org/W2073491323","doi":"https://doi.org/10.1137/0206033","mag":"2073491323"},"language":"en","primary_location":{"id":"doi:10.1137/0206033","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206033","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5043369298","display_name":"Richard E. Ladner","orcid":"https://orcid.org/0000-0001-9413-6774"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard E. Ladner","raw_affiliation_strings":["Department of Computer Science, University of Washington, Seattle, Washington 98195"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Washington, Seattle, Washington 98195","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043369298"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":7.524,"has_fulltext":false,"cited_by_count":555,"citation_normalized_percentile":{"value":0.96894361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"6","issue":"3","first_page":"467","last_page":"480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9787999987602234,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9782000184059143,"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/mathematics","display_name":"Mathematics","score":0.7491103410720825},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.708093523979187},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.637686550617218},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5686827301979065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.52034991979599},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5199531316757202},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.5167735815048218},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.5068359971046448},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4761005640029907},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.4664174020290375},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45360031723976135},{"id":"https://openalex.org/keywords/dynamic-logic","display_name":"Dynamic logic (digital electronics)","score":0.43962517380714417},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43162864446640015},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42497286200523376},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3214673101902008},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19549116492271423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17288264632225037},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.16049355268478394},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061105430126190186}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7491103410720825},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.708093523979187},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.637686550617218},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5686827301979065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.52034991979599},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5199531316757202},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.5167735815048218},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.5068359971046448},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4761005640029907},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.4664174020290375},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45360031723976135},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.43962517380714417},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43162864446640015},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42497286200523376},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3214673101902008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19549116492271423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17288264632225037},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.16049355268478394},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061105430126190186},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C172385210","wikidata":"https://www.wikidata.org/wiki/Q5339","display_name":"Transistor","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0206033","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206033","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.705.4317","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.4317","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.man.ac.uk/%7Eezolin/ml/bib/Computational_complexity_of_provability_in_systems_of_modal_logic_%28SIAMJC_1977%29.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1982129592","https://openalex.org/W1989887898","https://openalex.org/W2065251436","https://openalex.org/W2075277371","https://openalex.org/W2084684966","https://openalex.org/W2144347980","https://openalex.org/W2592184324"],"related_works":["https://openalex.org/W1498755214","https://openalex.org/W2534562289","https://openalex.org/W2901238796","https://openalex.org/W2952939288","https://openalex.org/W2260113151","https://openalex.org/W2151087759","https://openalex.org/W2187680313","https://openalex.org/W3108798275","https://openalex.org/W2142018979","https://openalex.org/W2123071520"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,55],"computational":[2,72,78],"complexity":[3,73,79],"of":[4,10,80,94,115],"the":[5,27,40,77],"provability":[6,28,41],"problem":[7,17,29,42,57,132],"in":[8,19,30,43,52,58,64,91,134],"systems":[9,93],"modal":[11,32,70,86,95,124],"proposi-tional":[12],"logic":[13],"is":[14,22,60,89,122,137],"investigated.":[15],"Every":[16],"computable":[18,133],"polynomial":[20,53,66,135],"space":[21,24,50,62,136],"log":[23,49,61,138],"reducible":[25],"to":[26,106],"any":[31],"system":[33,125],"between":[34,126],"K":[35,127],"and":[36,46,102,128],"$4.":[37],"In":[38,104],"particular,":[39],"K,":[44,99],"T,":[45,100],"$4":[47],"are":[48],"complete":[51,63],"space.":[54],"nonprovability":[56],"$5":[59],"nondeterministic":[65],"time.":[67],"Key":[68],"words,":[69],"logic,":[71,97],"Introduction.":[74],"We":[75],"investigate":[76],"deciding":[81],"whether":[82],"or":[83],"not":[84],"a":[85,113,123],"propositional":[87,96],"formula":[88],"provable":[90],"certain":[92],"including":[98],"$4,":[101,129],"$5.":[103],"terms":[105],"be":[107],"defined":[108],"later":[109],"we":[110],"show":[111],"(using":[112],"suggestion":[114],"S.":[116],"K.":[117],"Thomason)":[118],"that":[119],"if":[120],"S":[121],"then":[130],"every":[131]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":31},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":27}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}
