{"id":"https://openalex.org/W1771000901","doi":"https://doi.org/10.1007/978-3-540-92687-0_13","title":"Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees","display_name":"Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1771000901","doi":"https://doi.org/10.1007/978-3-540-92687-0_13","mag":"1771000901"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-92687-0_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92687-0_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5040324662","display_name":"Am\u00e9lie Gheerbrant","orcid":"https://orcid.org/0000-0002-8936-9829"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Am\u00e9lie Gheerbrant","raw_affiliation_strings":["ILLC, Universiteit van Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILLC, Universiteit van Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080220262","display_name":"Balder ten Cate","orcid":"https://orcid.org/0000-0002-2538-5846"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Balder ten Cate","raw_affiliation_strings":["ISLA, Universiteit van Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISLA, Universiteit van Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9936000108718872,"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.9936000108718872,"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/T10142","display_name":"Formal Methods in Verification","score":0.9934999942779541,"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.9926999807357788,"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/transitive-closure","display_name":"Transitive closure","score":0.8112019300460815},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6324195861816406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5982170701026917},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5685203671455383},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.538741946220398},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5320991277694702},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4570198059082031},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4532356262207031},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4482361674308777},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4426080286502838},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.4280466139316559},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.41447824239730835},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.40639716386795044},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39300093054771423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3857000172138214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20243996381759644},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.1940321922302246},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18925976753234863}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8112019300460815},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6324195861816406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5982170701026917},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5685203671455383},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.538741946220398},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5320991277694702},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4570198059082031},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4532356262207031},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4482361674308777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4426080286502838},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.4280466139316559},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.41447824239730835},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.40639716386795044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39300093054771423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3857000172138214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20243996381759644},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.1940321922302246},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18925976753234863},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-540-92687-0_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92687-0_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/43efd154-85c5-4c57-8802-32f9161e42e1","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/complete-axiomatizations-of-mso-fotc1-and-folfp1-on-finite-trees(43efd154-85c5-4c57-8802-32f9161e42e1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.5024","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.5024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.illc.uva.nl/Publications/ResearchReports/PP-2008-44.text.pdf","raw_type":"text"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/43efd154-85c5-4c57-8802-32f9161e42e1","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/complete-axiomatizations-of-mso-fotc1-and-folfp1-on-finite-trees(43efd154-85c5-4c57-8802-32f9161e42e1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings, 180 - 196","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W136390149","https://openalex.org/W1482193060","https://openalex.org/W1511526676","https://openalex.org/W1528689085","https://openalex.org/W1533614358","https://openalex.org/W1552186380","https://openalex.org/W1556189547","https://openalex.org/W1566708570","https://openalex.org/W1769844539","https://openalex.org/W1851620109","https://openalex.org/W2003304137","https://openalex.org/W2063943888","https://openalex.org/W2076056225","https://openalex.org/W2085467680","https://openalex.org/W2086101449","https://openalex.org/W2105505307","https://openalex.org/W2113317244","https://openalex.org/W2116099233","https://openalex.org/W2124638910","https://openalex.org/W2132638915","https://openalex.org/W2146886516","https://openalex.org/W2151886642","https://openalex.org/W2160331299","https://openalex.org/W2490561030","https://openalex.org/W2587382276","https://openalex.org/W4210921733"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W2123627450","https://openalex.org/W4230967508","https://openalex.org/W203725150","https://openalex.org/W1499233953"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}