{"id":"https://openalex.org/W2118416409","doi":"https://doi.org/10.2168/lmcs-4(4:11)2008","title":"First-Order and Temporal Logics for Nested Words","display_name":"First-Order and Temporal Logics for Nested Words","publication_year":2008,"publication_date":"2008-11-25","ids":{"openalex":"https://openalex.org/W2118416409","doi":"https://doi.org/10.2168/lmcs-4(4:11)2008","mag":"2118416409"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(4:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:11)2008","pdf_url":"https://lmcs.episciences.org/782/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/782/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["Department of Computer and Information Science, University of Pennsylvania","(UPenn),"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"(UPenn),","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011691423","display_name":"Marcelo Arenas","orcid":"https://orcid.org/0000-0003-3678-1868"},"institutions":[{"id":"https://openalex.org/I130474213","display_name":"Pontificia Universidad Cat\u00f3lica de Valpara\u00edso","ror":"https://ror.org/02cafbr77","country_code":"CL","type":"education","lineage":["https://openalex.org/I130474213"]},{"id":"https://openalex.org/I162148367","display_name":"Pontificia Universidad Cat\u00f3lica de Chile","ror":"https://ror.org/04teye511","country_code":"CL","type":"education","lineage":["https://openalex.org/I162148367"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Marcelo Arenas","raw_affiliation_strings":["Department of Computer Science, Pontificia Universidad Catlica de Chile","PUC, Chile"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Pontificia Universidad Catlica de Chile","institution_ids":["https://openalex.org/I162148367"]},{"raw_affiliation_string":"PUC, Chile","institution_ids":["https://openalex.org/I130474213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051683347","display_name":"Pablo Barcel\u00f3","orcid":"https://orcid.org/0000-0003-2293-2653"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Pablo Barcelo","raw_affiliation_strings":["U Chile"],"affiliations":[{"raw_affiliation_string":"U Chile","institution_ids":["https://openalex.org/I69737025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003946901","display_name":"Kousha Etessami","orcid":"https://orcid.org/0000-0001-5700-3462"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["U Edinburgh"],"affiliations":[{"raw_affiliation_string":"U Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053065200","display_name":"Neil Immerman","orcid":"https://orcid.org/0000-0001-6609-5952"},"institutions":[{"id":"https://openalex.org/I33434090","display_name":"University of Massachusetts Boston","ror":"https://ror.org/04ydmy275","country_code":"US","type":"education","lineage":["https://openalex.org/I33434090"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Immerman","raw_affiliation_strings":["Department of Computer Science,University of Massachusetts","UMASS"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,University of Massachusetts","institution_ids":["https://openalex.org/I33434090"]},{"raw_affiliation_string":"UMASS","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069883356","display_name":"Leonid Libkin","orcid":"https://orcid.org/0000-0002-6698-2735"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leonid Libkin","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh","Edinbugh"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Edinbugh","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":12.3484,"has_fulltext":true,"cited_by_count":100,"citation_normalized_percentile":{"value":0.98961389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"Volume 4, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/satisfiability","display_name":"Satisfiability","score":0.7595768570899963},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5549356937408447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5536193251609802},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.5359374284744263},{"id":"https://openalex.org/keywords/nested-set-model","display_name":"Nested set model","score":0.48652806878089905},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48051533102989197},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4768570363521576},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4633285403251648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45641475915908813},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.453821063041687},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4518328905105591},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.44513213634490967},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.44369930028915405},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.43072041869163513},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.418877512216568},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4168780446052551},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41621699929237366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40752682089805603},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38380324840545654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3664345145225525},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.312578409910202},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.28348976373672485},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2541242837905884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18946516513824463},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16775348782539368},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14789006114006042},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08685833215713501}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7595768570899963},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5549356937408447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5536193251609802},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.5359374284744263},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.48652806878089905},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48051533102989197},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4768570363521576},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4633285403251648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45641475915908813},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.453821063041687},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4518328905105591},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.44513213634490967},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.44369930028915405},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.43072041869163513},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.418877512216568},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4168780446052551},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41621699929237366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40752682089805603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38380324840545654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3664345145225525},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.312578409910202},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.28348976373672485},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2541242837905884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18946516513824463},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16775348782539368},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14789006114006042},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08685833215713501},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C510870499","wikidata":"https://www.wikidata.org/wiki/Q47607","display_name":"SQL","level":2,"score":0.0},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0}],"mesh":[],"locations_count":17,"locations":[{"id":"doi:10.2168/lmcs-4(4:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:11)2008","pdf_url":"https://lmcs.episciences.org/782/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:americanae.aecid.es:3265158","is_oa":true,"landing_page_url":"http://hdl.handle.net/10533/140885","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"LOGICAL METHODS IN COMPUTER SCIENCE","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/699710f7-528d-4d7a-b8fb-7781a0aabb85","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/699710f7-528d-4d7a-b8fb-7781a0aabb85","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Alur, R, Arenas, M, Barcel\u00f3, P, Etessami, K, Immerman, N & Libkin, L 2008, 'First-Order and Temporal Logics for Nested Words', Logical Methods in Computer Science, vol. 4, no. 4. https://doi.org/10.2168/LMCS-4(4:11)2008","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:0811.0537","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.0537","pdf_url":"https://arxiv.org/pdf/0811.0537","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:CiteSeerX.psu:10.1.1.123.8536","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.8536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcc.uchile.cl/~pbarcelo/lics07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.4089","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.4089","pdf_url":null,"source":null,"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.245.4791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.245.4791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0811.0537v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.9988","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.9988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.inf.ed.ac.uk/kousha/lics07_final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.9359","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~alur/Lics07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.648.4135","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.4135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.ing.puc.cl/~marenas/publications/lics07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~immerman/pub/lics07FinalLong.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:2ec30fa1e3fa44c4b54fcef3c29ebff0","is_oa":true,"landing_page_url":"https://doaj.org/article/2ec30fa1e3fa44c4b54fcef3c29ebff0","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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 4, Issue 4 (2008)","raw_type":"article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/699710f7-528d-4d7a-b8fb-7781a0aabb85","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/699710f7-528d-4d7a-b8fb-7781a0aabb85","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alur, R, Arenas, M, Barcel\u00f3, P, Etessami, K, Immerman, N & Libkin, L 2008, 'First-Order and Temporal Logics for Nested Words', Logical Methods in Computer Science, vol. 4, no. 4. https://doi.org/10.2168/LMCS-4(4:11)2008","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6471","is_oa":true,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6471","pdf_url":null,"source":{"id":"https://openalex.org/S4377196331","display_name":"Scholarly Commons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"4","raw_type":"Article"},{"id":"pmh:oai:repository.upenn.edu:cis_papers-1452","is_oa":false,"landing_page_url":"https://repository.upenn.edu/cis_papers/421","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:20.500.14394/10180","is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.14394/10180","pdf_url":null,"source":{"id":"https://openalex.org/S4306402057","display_name":"Scholarworks (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"},{"id":"pmh:oai:works.bepress.com:neil_immerman-1002","is_oa":true,"landing_page_url":"https://works.bepress.com/neil_immerman/3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neil Immerman","raw_type":"text"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(4:11)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:11)2008","pdf_url":"https://lmcs.episciences.org/782/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":[{"id":"https://openalex.org/G1003392328","display_name":null,"funder_award_id":"EP/E005039/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1200680708","display_name":"Synaptic Mechanisms for the Processing of Temporal Codes","funder_award_id":"1050701","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3330119427","display_name":null,"funder_award_id":"EPSRC","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4068919120","display_name":"Behavioral Interfaces for Software Components","funder_award_id":"0541149","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G428904398","display_name":null,"funder_award_id":"E005039","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4778211089","display_name":"Variables versus Size: Tradeoffs in Descriptive Complexity","funder_award_id":"0830174","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6398122256","display_name":null,"funder_award_id":"05039","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6748371010","display_name":null,"funder_award_id":"FONDECYT","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2118416409.pdf","grobid_xml":"https://content.openalex.org/works/W2118416409.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W255293104","https://openalex.org/W560079301","https://openalex.org/W1484039100","https://openalex.org/W1484900789","https://openalex.org/W1492682035","https://openalex.org/W1514446453","https://openalex.org/W1556566737","https://openalex.org/W1583633027","https://openalex.org/W1691700263","https://openalex.org/W1725438563","https://openalex.org/W1884719254","https://openalex.org/W1970599921","https://openalex.org/W1976808588","https://openalex.org/W2003304137","https://openalex.org/W2023251419","https://openalex.org/W2032411923","https://openalex.org/W2053510959","https://openalex.org/W2059078591","https://openalex.org/W2066585576","https://openalex.org/W2070632872","https://openalex.org/W2078015341","https://openalex.org/W2092650892","https://openalex.org/W2098171268","https://openalex.org/W2103146530","https://openalex.org/W2131159347","https://openalex.org/W2131886132","https://openalex.org/W2137931097","https://openalex.org/W2151033407","https://openalex.org/W2151670874","https://openalex.org/W2159701549","https://openalex.org/W2294034341","https://openalex.org/W2492759008","https://openalex.org/W4231443958","https://openalex.org/W6633251914","https://openalex.org/W6639433200","https://openalex.org/W6664955335","https://openalex.org/W6675465768","https://openalex.org/W6682069976"],"related_works":["https://openalex.org/W2026191634","https://openalex.org/W4299312496","https://openalex.org/W2111351089","https://openalex.org/W2126897484","https://openalex.org/W2404907747","https://openalex.org/W1551901662","https://openalex.org/W2045826397","https://openalex.org/W4287076279","https://openalex.org/W1490074134","https://openalex.org/W925486019"],"abstract_inverted_index":{"Nested":[0],"words":[1,21,160,173],"are":[2,48,58],"a":[3,68,72,75,78,104,168],"structured":[4],"model":[5,138],"of":[6,26,51,62,86,89,103,135,144,181],"execution":[7],"paths":[8],"in":[9,83,129,132,141],"procedural":[10],"programs,":[11],"reflecting":[12],"their":[13],"call":[14],"and":[15,29,43,53,112,123,139,165],"return":[16],"nesting":[17,113],"structure.":[18],"Finite":[19],"nested":[20,45,159,172],"also":[22,150],"capture":[23],"the":[24,84,101,110,133,136,142,145,162,178],"structure":[25],"parse":[27],"trees":[28],"other":[30,95],"tree-structured":[31],"data,":[32],"such":[33],"as":[34],"XML.":[35],"We":[36],"provide":[37],"new":[38],"temporal":[39,169],"logics":[40,57],"for":[41,171,177],"finite":[42],"infinite":[44],"words,":[46],"which":[47,174],"natural":[49],"extensions":[50],"LTL,":[52],"prove":[54,154],"that":[55,107,119,124,155],"these":[56],"first-order":[59,156],"expressively-complete.":[60],"One":[61],"them":[63],"is":[64,98,121,149,175],"based":[65,99],"on":[66,74,100],"adding":[67],"\"within\"":[69],"modality,":[70],"evaluating":[71],"formula":[73,147],"subword,":[76],"to":[77],"logic":[79,157,170],"CaRet":[80],"previously":[81],"studied":[82],"context":[85],"verifying":[87],"properties":[88],"recursive":[90],"state":[91],"machines":[92],"(RSMs).":[93],"The":[94],"logic,":[96],"NWTL,":[97],"notion":[102],"summary":[105],"path":[106],"uses":[108],"both":[109],"linear":[111],"structures.":[114],"For":[115],"NWTL":[116,146],"we":[117,153,166],"show":[118],"satisfiability":[120],"EXPTIME-complete,":[122],"model-checking":[125],"can":[126],"be":[127],"done":[128],"time":[130],"polynomial":[131],"size":[134,143],"RSM":[137],"exponential":[140],"(and":[148],"EXPTIME-complete).":[151],"Finally,":[152],"over":[158],"has":[161],"three-variable":[163],"property,":[164],"present":[167],"complete":[176],"two-variable":[179],"fragment":[180],"first-order.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2020-11-23T00:00:00"}