{"id":"https://openalex.org/W2067464091","doi":"https://doi.org/10.1016/s0304-3975(01)00185-2","title":"Monadic second-order logic on tree-like structures","display_name":"Monadic second-order logic on tree-like structures","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W2067464091","doi":"https://doi.org/10.1016/s0304-3975(01)00185-2","mag":"2067464091"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00185-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00185-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland","(Warsaw University, Warsaw, Poland)"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"(Warsaw University, Warsaw, Poland)","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064757019"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":8.0486,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.98233964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"275","issue":"1-2","first_page":"311","last_page":"346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9977999925613403,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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/unary-operation","display_name":"Unary operation","score":0.7025964260101318},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.6748430728912354},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6404336094856262},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6053944826126099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5909212231636047},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.559100329875946},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4798842966556549},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46090683341026306},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.42188510298728943},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41602420806884766},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3531830906867981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33626294136047363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.324232280254364},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31674808263778687},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23600807785987854},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.20245906710624695},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1315561830997467},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.08045434951782227}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7025964260101318},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.6748430728912354},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6404336094856262},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6053944826126099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5909212231636047},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.559100329875946},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4798842966556549},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46090683341026306},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.42188510298728943},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41602420806884766},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3531830906867981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33626294136047363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.324232280254364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31674808263778687},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23600807785987854},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.20245906710624695},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1315561830997467},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.08045434951782227}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(01)00185-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00185-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":41,"referenced_works":["https://openalex.org/W135426567","https://openalex.org/W1482193060","https://openalex.org/W1487855130","https://openalex.org/W1528467909","https://openalex.org/W1539382740","https://openalex.org/W1539385324","https://openalex.org/W1555991696","https://openalex.org/W1560050980","https://openalex.org/W1584587517","https://openalex.org/W1587779614","https://openalex.org/W1602067282","https://openalex.org/W1604967698","https://openalex.org/W1605677512","https://openalex.org/W1816620374","https://openalex.org/W1949254612","https://openalex.org/W1969912861","https://openalex.org/W1971138850","https://openalex.org/W1993698725","https://openalex.org/W2020520119","https://openalex.org/W2030683439","https://openalex.org/W2060375000","https://openalex.org/W2062792526","https://openalex.org/W2067672151","https://openalex.org/W2083398633","https://openalex.org/W2113800199","https://openalex.org/W2131663704","https://openalex.org/W2142458264","https://openalex.org/W2142707270","https://openalex.org/W2162583406","https://openalex.org/W2170933628","https://openalex.org/W2345804736","https://openalex.org/W2366016916","https://openalex.org/W2969873114","https://openalex.org/W3043060850","https://openalex.org/W4230295967","https://openalex.org/W4242654370","https://openalex.org/W6636382895","https://openalex.org/W6638352968","https://openalex.org/W6641740895","https://openalex.org/W6685257347","https://openalex.org/W6828401895"],"related_works":["https://openalex.org/W2033265717","https://openalex.org/W2584847196","https://openalex.org/W1539443054","https://openalex.org/W1049919373","https://openalex.org/W4386351167","https://openalex.org/W2147159309","https://openalex.org/W2094403718","https://openalex.org/W1545660605","https://openalex.org/W2016122306","https://openalex.org/W2067464091"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}