{"id":"https://openalex.org/W2023552332","doi":"https://doi.org/10.2307/2274958","title":"Reachability is harder for directed than for undirected finite graphs","display_name":"Reachability is harder for directed than for undirected finite graphs","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2023552332","doi":"https://doi.org/10.2307/2274958","mag":"2023552332"},"language":"en","primary_location":{"id":"doi:10.2307/2274958","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2274958","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","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/A5109091195","display_name":"Mikl\u00f3s Ajtai","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Miklos Ajtai","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, California 95120"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, California 95120","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027117465","display_name":"Ronald Fagin","orcid":"https://orcid.org/0000-0002-7374-0347"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald Fagin","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, California 95120"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, California 95120","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109091195"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":4.3184,"has_fulltext":false,"cited_by_count":127,"citation_normalized_percentile":{"value":0.94327929,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"55","issue":"1","first_page":"113","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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.9990000128746033,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7207300662994385},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.6484493613243103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5837857723236084},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.538429856300354},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5307908654212952},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4927566349506378},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4898652732372284},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47933897376060486},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.43938320875167847},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.42711806297302246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13473612070083618}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7207300662994385},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.6484493613243103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5837857723236084},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.538429856300354},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5307908654212952},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4927566349506378},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4898652732372284},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47933897376060486},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.43938320875167847},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.42711806297302246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13473612070083618},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2274958","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2274958","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183743189","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183743189","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"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":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.309","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.almaden.ibm.com/cs/people/fagin/jsl90.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1555138513","https://openalex.org/W1970629906","https://openalex.org/W1979036815","https://openalex.org/W1979740015","https://openalex.org/W1982129592","https://openalex.org/W1984581643","https://openalex.org/W1984890936","https://openalex.org/W1988663974","https://openalex.org/W2003895694","https://openalex.org/W2004663163","https://openalex.org/W2027188157","https://openalex.org/W2036656440","https://openalex.org/W2042587503","https://openalex.org/W2049016755","https://openalex.org/W2065555531","https://openalex.org/W2088094394","https://openalex.org/W2093117456","https://openalex.org/W2098265073","https://openalex.org/W2104881994","https://openalex.org/W2125362004","https://openalex.org/W2317459460","https://openalex.org/W2399914283","https://openalex.org/W2748837517","https://openalex.org/W2797041136","https://openalex.org/W2905110430","https://openalex.org/W3127113455","https://openalex.org/W4245713184"],"related_works":["https://openalex.org/W2043128958","https://openalex.org/W2075073335","https://openalex.org/W1576168316","https://openalex.org/W4294093643","https://openalex.org/W3196191381","https://openalex.org/W2346528079","https://openalex.org/W2764127424","https://openalex.org/W2023059211","https://openalex.org/W2370572809","https://openalex.org/W2798936174"],"abstract_inverted_index":{"Abstract":[0],"Although":[1],"it":[2],"is":[3,23,26,73],"known":[4],"that":[5,24,61],"reachability":[6,72],"in":[7,35],"undirected":[8],"finite":[9,32,64],"graphs":[10,33,65],"can":[11],"be":[12],"expressed":[13],"by":[14,75],"an":[15,76],"existential":[16,77],"monadic":[17,78],"second-order":[18,79],"sentence,":[19],"our":[20],"main":[21],"result":[22],"this":[25],"not":[27],"the":[28,36,44],"case":[29],"for":[30,62],"directed":[31,63],"(even":[34],"presence":[37],"of":[38,51],"certain":[39],"\u201cbuilt-in\u201d":[40],"relations,":[41],"such":[42],"as":[43],"successor":[45],"relation).":[46],"The":[47],"proof":[48],"makes":[49],"use":[50],"Ehrenfeucht-Fra\u00efss\u00e9":[52],"games,":[53],"along":[54],"with":[55,66],"probabilistic":[56],"arguments.":[57],"However,":[58],"we":[59],"show":[60],"degree":[67],"at":[68],"most":[69],"k":[70],",":[71],"expressible":[74],"sentence.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}