{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:34Z","timestamp":1760202814294,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_10","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"161-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"Jim","family":"de Groot","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s11225-016-9664-1","volume":"104","author":"G Badia","year":"2016","unstructured":"Badia, G.: Bi-simulating in bi-intuitionistic logic. Studia Logica 104, 1037\u20131050 (2016)","journal-title":"Studia Logica"},{"key":"10_CR2","unstructured":"Bezhanishvili, N.: Lattices of intermediate and cylindric modal logics. Ph.D. thesis. University of Amsterdam (2006)"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1997)"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1093\/logcom\/14.4.529","volume":"14","author":"T Crolard","year":"2004","unstructured":"Crolard, T.: A formulae-as-types interpretation of subtractive logic. J. Log. Comput. 14(4), 529\u2013570 (2004)","journal-title":"J. Log. Comput."},{"key":"10_CR5","first-page":"147","volume":"15","author":"L Esakia","year":"1974","unstructured":"Esakia, L.: Topological Kripke models. Soviet Mathematics Doklady 15, 147\u2013151 (1974)","journal-title":"Soviet Mathematics Doklady"},{"key":"10_CR6","unstructured":"Esakia, L.: The problem of dualism in the intuitionistic logic and Browerian lattices. In: V International Congress of Logic, Methodology and Philosophy of Science, Canada, pp. 7\u20138 (1975)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/10722086_21","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R Gor\u00e9","year":"2000","unstructured":"Gor\u00e9, R.: Dual intuitionistic logic revisited. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 252\u2013267. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722086_21"},{"key":"10_CR8","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S Lane","year":"1971","unstructured":"Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4612-9839-7"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-63141-0_24","volume-title":"CONCUR 1997: Concurrency Theory","author":"A Patterson","year":"1997","unstructured":"Patterson, A.: Bisimulation and propositional intuitionistic logic. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 347\u2013360. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0_24"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-02716-1_22","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"L Pinto","year":"2009","unstructured":"Pinto, L., Uustalu, T.: Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol. 5607, pp. 295\u2013309. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02716-1_22"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1112\/blms\/2.2.186","volume":"2","author":"HA Priestley","year":"1970","unstructured":"Priestley, H.A.: Representation of distributive lattices by means of ordered Stone spaces. Bull. Lond. Math. Soc. 2(2), 186\u2013190 (1970)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02120864","volume":"33","author":"C Rauszer","year":"1974","unstructured":"Rauszer, C.: A formalization of the propositional calculus of H-B logic. Studia Logica 33(1), 23\u201334 (1974)","journal-title":"Studia Logica"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.4064\/fm-83-3-219-249","volume":"83","author":"Cecylia Rauszer","year":"1974","unstructured":"Rauszer, C.: Semi-Boolean algebras and their application to intuitionistic logic with dual operations. In: Fundamenta Mathematicae LXXXIII, pp. 219\u2013249 (1974)","journal-title":"Fundamenta Mathematicae"},{"key":"10_CR14","unstructured":"Rauszer, C.: An algebraic and Kripke-style approach to a certain extension of intuitionistic logic. Dissertationes Mathematicae, Polish Scientific Publishers (1980)"},{"key":"10_CR15","unstructured":"Restall, G.: Extending intuitionistic logic with subtraction (1997). http:\/\/consequently.org\/writing\/"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jal.2017.12.001","volume":"25","author":"L Tranchini","year":"2017","unstructured":"Tranchini, L.: Natural deduction for bi-intuitionistic logic. J. Appl. Log. 25, 72\u201396 (2017)","journal-title":"J. Appl. Log."},{"key":"10_CR17","series-title":"Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science)","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-94-017-2109-7_17","volume-title":"Logic and Foundations of Mathematics","author":"F Wolter","year":"1999","unstructured":"Wolter, F., Zakharyaschev, M.: Intuitionistic modal logic. In: Cantini, A., Casari, E., Minari, P. (eds.) Logic and Foundations of Mathematics. SYLI, vol. 280, pp. 227\u2013238. Springer, Dordrecht (1999). https:\/\/doi.org\/10.1007\/978-94-017-2109-7_17"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T03:51:48Z","timestamp":1721447508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}