{"id":"https://openalex.org/W2033100041","doi":"https://doi.org/10.1016/0304-3975(90)90038-j","title":"Proof systems for satisfiability in Hennessy-Milner Logic with recursion","display_name":"Proof systems for satisfiability in Hennessy-Milner Logic with recursion","publication_year":1990,"publication_date":"1990-05-01","ids":{"openalex":"https://openalex.org/W2033100041","doi":"https://doi.org/10.1016/0304-3975(90)90038-j","mag":"2033100041"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(90)90038-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90038-j","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/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kim G. Larsen","raw_affiliation_strings":["Aalberg University Centre, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalberg University Centre, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069362159"],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":7.4633,"has_fulltext":false,"cited_by_count":131,"citation_normalized_percentile":{"value":0.97860181,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"72","issue":"2-3","first_page":"265","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9991999864578247,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.987500011920929,"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"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9805999994277954,"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/recursion","display_name":"Recursion (computer science)","score":0.812648594379425},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.7542071342468262},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6047317981719971},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5133032202720642},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.49647194147109985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4830825626850128},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.4509996771812439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4446898102760315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4117544889450073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3331329822540283},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.32990193367004395},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2799297869205475}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.812648594379425},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.7542071342468262},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6047317981719971},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5133032202720642},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.49647194147109985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4830825626850128},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.4509996771812439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4446898102760315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117544889450073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3331329822540283},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.32990193367004395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2799297869205475},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(90)90038-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90038-j","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"},{"id":"pmh:oai:pure.atira.dk:publications/13c8bc00-9c2f-11db-8ed6-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/13c8bc00-9c2f-11db-8ed6-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larsen, K G 1990, 'Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion', Theoretical Computer Science, vol. 72 s.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W32773943","https://openalex.org/W1487199072","https://openalex.org/W1547562281","https://openalex.org/W1548644447","https://openalex.org/W1569431692","https://openalex.org/W1577412708","https://openalex.org/W1584397286","https://openalex.org/W1590315663","https://openalex.org/W1604297451","https://openalex.org/W1966330762","https://openalex.org/W1969682671","https://openalex.org/W1978469611","https://openalex.org/W2000138546","https://openalex.org/W2001748564","https://openalex.org/W2002458545","https://openalex.org/W2015640848","https://openalex.org/W2017477569","https://openalex.org/W2036996017","https://openalex.org/W2046213250","https://openalex.org/W2046327127","https://openalex.org/W2054554282","https://openalex.org/W2137865376","https://openalex.org/W2171536993","https://openalex.org/W2969873114","https://openalex.org/W3022040200","https://openalex.org/W6601315952","https://openalex.org/W6629246647","https://openalex.org/W6630053826","https://openalex.org/W6632601584","https://openalex.org/W6632813450","https://openalex.org/W6633801175","https://openalex.org/W6635113102","https://openalex.org/W6636062432","https://openalex.org/W6642687506","https://openalex.org/W6677551240","https://openalex.org/W6680753846","https://openalex.org/W6685341142"],"related_works":["https://openalex.org/W1565271071","https://openalex.org/W2081199208","https://openalex.org/W3349016","https://openalex.org/W3160870209","https://openalex.org/W2494011163","https://openalex.org/W2053262709","https://openalex.org/W1582159526","https://openalex.org/W136121193","https://openalex.org/W241023240","https://openalex.org/W2181724188"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}