{"id":"https://openalex.org/W2029183607","doi":"https://doi.org/10.1093/logcom/exq008","title":"Expressing versus Proving: Relating Forms of Complexity in Logic","display_name":"Expressing versus Proving: Relating Forms of Complexity in Logic","publication_year":2010,"publication_date":"2010-02-09","ids":{"openalex":"https://openalex.org/W2029183607","doi":"https://doi.org/10.1093/logcom/exq008","mag":"2029183607"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exq008","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq008","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/A5003773985","display_name":"Antonina Kolokolova","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"A. Kolokolova","raw_affiliation_strings":["Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Canada.E-mail: kol@cs.mun.ca","Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Canada.E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Canada.E-mail: kol@cs.mun.ca","institution_ids":["https://openalex.org/I130438778"]},{"raw_affiliation_string":"Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Canada.E-mail:","institution_ids":["https://openalex.org/I130438778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003773985"],"corresponding_institution_ids":["https://openalex.org/I130438778"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09875017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"2","first_page":"267","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994999766349792,"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.9994999766349792,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9993000030517578,"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.9972000122070312,"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/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.8429850339889526},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.7457167506217957},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7456028461456299},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.7107055187225342},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5983410477638245},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5602070689201355},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5497567653656006},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.5473775863647461},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.53641676902771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5295124053955078},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.499070405960083},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.45226114988327026},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.43997105956077576},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.4359486699104309},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4256635308265686},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41527605056762695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40823760628700256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2691391110420227},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.23392540216445923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2331732213497162},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12342411279678345}],"concepts":[{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.8429850339889526},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.7457167506217957},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7456028461456299},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.7107055187225342},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5983410477638245},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5602070689201355},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5497567653656006},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.5473775863647461},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.53641676902771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5295124053955078},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.499070405960083},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.45226114988327026},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.43997105956077576},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4359486699104309},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4256635308265686},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41527605056762695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40823760628700256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2691391110420227},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.23392540216445923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2331732213497162},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12342411279678345},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exq008","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq008","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W87231157","https://openalex.org/W147427843","https://openalex.org/W1489366126","https://openalex.org/W1532021344","https://openalex.org/W1537230380","https://openalex.org/W1572451808","https://openalex.org/W1590283810","https://openalex.org/W1594732291","https://openalex.org/W1607926272","https://openalex.org/W1981324778","https://openalex.org/W1993138363","https://openalex.org/W2014917736","https://openalex.org/W2030330223","https://openalex.org/W2033743662","https://openalex.org/W2036265926","https://openalex.org/W2036651904","https://openalex.org/W2036656440","https://openalex.org/W2040404640","https://openalex.org/W2040579873","https://openalex.org/W2041616904","https://openalex.org/W2069301430","https://openalex.org/W2071260871","https://openalex.org/W2087012565","https://openalex.org/W2091961944","https://openalex.org/W2093779107","https://openalex.org/W2128026324","https://openalex.org/W2128428740","https://openalex.org/W2161202133","https://openalex.org/W2166162093","https://openalex.org/W2166566648","https://openalex.org/W2171280299","https://openalex.org/W2460611553","https://openalex.org/W2912080987","https://openalex.org/W3105529609","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W342214647","https://openalex.org/W2047754121","https://openalex.org/W1512399864","https://openalex.org/W2029183607","https://openalex.org/W2041069649","https://openalex.org/W2035152936","https://openalex.org/W1988772559","https://openalex.org/W2555446247"],"abstract_inverted_index":{"Complexity":[0],"in":[1,4,19,29,40,61,73,82,100,176],"logic":[2],"comes":[3],"many":[5],"forms.":[6],"In":[7,52],"finite":[8,65],"model":[9,66],"theory,":[10],"it":[11,22],"is":[12,23,68,104,111,128,157],"the":[13,24,42,57,62,90,112,122,137,146],"complexity":[14,21,25,39,58,115,141,149,172,175],"of":[15,26,38,59,64,86,124,139,148,150],"describing":[16],"properties,":[17],"whereas":[18],"proof":[20,31],"proving":[27],"properties":[28],"a":[30,101,161],"system.":[32],"Here,":[33],"we":[34,54,133],"consider":[35],"several":[36],"notions":[37],"logic,":[41,144],"connections":[43],"among":[44],"them":[45],"and":[46,117,145,174],"their":[47],"relationship":[48],"with":[49,171],"computational":[50],"complexity.":[51],"particular,":[53],"show":[55],"how":[56],"logics":[60],"setting":[63],"theory":[67,142,173],"used":[69],"to":[70,159],"obtain":[71],"results":[72],"bounded":[74],"arithmetic,":[75],"stating":[76],"which":[77],"functions":[78],"are":[79,168],"provably":[80],"total":[81],"certain":[83],"weak":[84],"systems":[85],"arithmetic.":[87],"For":[88],"example,":[89],"transitive":[91],"closure":[92,123],"function":[93],"(testing":[94],"reachability":[95],"between":[96],"two":[97],"given":[98],"points":[99],"directed":[102],"graph)":[103],"definable":[105],"using":[106,143],"only":[107],"NL-concepts":[108],"(where":[109],"NL":[110,125],"non-deterministic":[113],"logspace":[114],"class)":[116],"its":[118],"totality":[119],"(and,":[120],"thus,":[121],"under":[126],"complementation)":[127],"provable":[129],"within":[130],"NL-reasoning.":[131],"Lastly,":[132],"will":[134],"touch":[135],"upon":[136],"topic":[138],"formalizing":[140],"meta-question":[147],"logical":[151],"reasoning":[152],"about":[153],"complexity-theoretic":[154],"statements.":[155],"This":[156],"intended":[158],"be":[160],"high-level":[162],"overview,":[163],"suitable":[164],"for":[165],"readers":[166],"who":[167],"not":[169],"familiar":[170],"logic.":[177]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}