{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T18:13:17Z","timestamp":1792087997705,"version":"4.4.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031152979","type":"print"},{"value":"9783031152986","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15298-6_5","type":"book-chapter","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T08:55:10Z","timestamp":1662627310000},"page":"70-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tense Logics over\u00a0Lattices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2924-3300","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9499-416X","authenticated-orcid":false,"given":"Yanjing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: Semantic parallels in natural language and computation. In: Studies in Logic and the Foundations of Mathematics, vol. 129 (1989)","DOI":"10.1016\/S0049-237X(08)70133-2"},{"key":"5_CR2","first-page":"135","volume-title":"Logic and Reality: Essays on the legacy of Arthur Prior","author":"J van Benthem","year":"1996","unstructured":"van Benthem, J.: Modal logic as a theory of information. In: Copeland, J. (ed.) Logic and Reality: Essays on the legacy of Arthur Prior, pp. 135\u2013158. Clarendon Press, Oxford (1996)"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10992-018-9485-y","volume":"48","author":"J van Benthem","year":"2019","unstructured":"van Benthem, J.: Implicit and explicit stances in logic. J. Philos. Log. 48(3), 571\u2013601 (2019)","journal-title":"J. Philos. Log."},{"key":"5_CR4","volume-title":"The Logic of Quantum Mechanics","author":"G Birkhoff","year":"1975","unstructured":"Birkhoff, G., Neumann, J.V.: The Logic of Quantum Mechanics. Springer, Dordrecht (1975)"},{"key":"5_CR5","unstructured":"Birkhoff, G.T.: Lattice Theory. American Mathematical Society (1967)"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"5_CR7","first-page":"56","volume":"34","author":"P Blackburn","year":"1993","unstructured":"Blackburn, P.: Nominal tense logic. Notre Dame J. Formal Logic 34(1), 56\u201383 (1993)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.2307\/2273184","volume":"45","author":"WJ Blok","year":"1980","unstructured":"Blok, W.J.: The lattice of modal logics: an algebraic investigation. J. Symb. Log. 45(2), 221\u2013236 (1980)","journal-title":"J. Symb. Log."},{"issue":"5","key":"5_CR9","first-page":"107","volume":"12","author":"G Boole","year":"2009","unstructured":"Boole, G.: The mathematical analysis of logic. Bull. Math. Biophys. 12(5), 107\u2013107 (2009)","journal-title":"Bull. Math. Biophys."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-94-009-6259-0_2","volume-title":"Handbook of Philosophical Logic: Volume II: Extensions of Classical Logic","author":"JP Burgess","year":"1984","unstructured":"Burgess, J.P.: Basic tense logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Volume II: Extensions of Classical Logic, pp. 89\u2013133. Springer, Dordrecht (1984). https:\/\/doi.org\/10.1007\/978-94-009-6259-0_2"},{"issue":"2\u20133","key":"5_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10992-013-9281-7","volume":"43","author":"K Fine","year":"2014","unstructured":"Fine, K.: Truth-maker semantics for intuitionistic logic. J. Philos. Log. 43(2\u20133), 549\u2013577 (2014)","journal-title":"J. Philos. Log."},{"issue":"6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G Gargov","year":"1993","unstructured":"Gargov, G., Goranko, V.: Modal logic with names. J. Philos. Log. 22(6), 607\u2013636 (1993)","journal-title":"J. Philos. Log."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Goldblatt, R., Hodkinson, I.: The McKinsey-Lemmon logic is barely canonical. Australas. J. Logic 5 (2007)","DOI":"10.26686\/ajl.v5i0.1783"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hamkins, J.D., Kikuchi, M.: Set-theoretic mereology. Logic Logical Philos. Special issue \u201cMereology and beyond, Part II\u201d 25(3), 285\u2013308 (2016)","DOI":"10.12775\/LLP.2016.007"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s11225-016-9680-1","volume":"105","author":"WH Holliday","year":"2017","unstructured":"Holliday, W.H.: On the modal logic of subset and superset: tense logic over Medvedev frames. Stud. Logica. 105(1), 13\u201335 (2017)","journal-title":"Stud. Logica."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Li, D., Wang, Y.: Mereological bimodal logics. Rev. Symb. Logic 1\u201336 (2022). https:\/\/doi.org\/10.1017\/S175502032200003X","DOI":"10.1017\/S175502032200003X"},{"key":"5_CR17","first-page":"501","volume":"104","author":"YT Medvedev","year":"1955","unstructured":"Medvedev, Y.T.: Degrees of difficulty of the mass problems. Dokl. Akad. Nauk SSSR 104, 501\u2013504 (1955)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"5_CR18","unstructured":"Prior, A.: Time and Modality. Oxford University Press, Clarendon Press (1957)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF02054946","volume":"123","author":"A Rose","year":"1951","unstructured":"Rose, A.: Systems of logic whose truth-values form lattices. Math. Ann. 123, 152\u2013165 (1951)","journal-title":"Math. Ann."},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S1755020310000134","volume":"3","author":"M Sadrzadeh","year":"2010","unstructured":"Sadrzadeh, M., Dyckhoff, R.: Positive logic with adjoint modalities: proof theory, semantics, and reasoning about information. Rev. Symb. Logic 3(3), 351\u2013373 (2010)","journal-title":"Rev. Symb. Logic"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15298-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T23:03:18Z","timestamp":1663023798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15298-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031152979","9783031152986"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15298-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 September 2022","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":"Ia\u015fi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28th","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2022.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"46","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":"25","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":"0","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":"54% - 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","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":"6","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)"}},{"value":"08 extra abstracts: 05 invited talks and 03 tutorials","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}