{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:00:01Z","timestamp":1742932801283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030887001"},{"type":"electronic","value":"9783030887018"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-88701-8_17","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:06:25Z","timestamp":1634857585000},"page":"275-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Free Modal Riesz Spaces are Archimedean: A Syntactic Proof"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Lucas","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Mio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: From Foundations to Applications: European Logic Colloquium, pp. 1\u201332. Oxford University Press (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.4153\/CJM-1968-008-x","volume":"20","author":"KA Baker","year":"1968","unstructured":"Baker, K.A.: Free vector lattices. Can. J. Math. 20, 58\u201366 (1968)","journal-title":"Can. J. Math."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0002-9947-1973-0311541-8","volume":"176","author":"RD Bleier","year":"1973","unstructured":"Bleier, R.D.: Free vector lattices. Trans. Am. Math. Soc. 176, 73\u201387 (1973)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11786-014-0181-1","volume":"9","author":"S Boldo","year":"2014","unstructured":"Boldo, S., Lelay, C., Melquiond, G.: Coquelicot: a user-friendly library of real analysis for coq. Math. Comput. Sci. 9(1), 41\u201362 (2014). https:\/\/doi.org\/10.1007\/s11786-014-0181-1","journal-title":"Math. Comput. Sci."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.23638\/LMCS-14(1:10)2018","volume":"14","author":"D Denisa","year":"2018","unstructured":"Denisa, D., Metcalfe, G., Schn\u00fcriger, L.: A real-valued modal logic. Log. Methods Comput. Sci. 14(1), 10 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:10)2018","journal-title":"Log. Methods Comput. Sci."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.23638\/LMCS-16(1:6)2020","volume":"16","author":"R Furber","year":"2020","unstructured":"Furber, R., Mardare, R., Mio, M.: Probabilistic logics based on riesz spaces. Logical Methods Comput. Sci. 16(1), 6 (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:6)2020","journal-title":"Logical Methods Comput. Sci."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1017\/S0960129500000451","volume":"4","author":"A Fleury","year":"1994","unstructured":"Fleury, A., Retor\u00e9, C.: The mix rule. Math. Struct. Comput. Sci. 4(2), 273\u2013285 (1994). https:\/\/doi.org\/10.1017\/S0960129500000451","journal-title":"Math. Struct. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01201363","volume":"39","author":"G Gentzen","year":"1934","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Math. Z. 39, 405\u2013431 (1934)","journal-title":"Math. Z."},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511897207","volume-title":"Topological Riesz Spaces and Measure Theory","author":"DH Fremlin","year":"1974","unstructured":"Fremlin, D.H.: Topological Riesz Spaces and Measure Theory. Cambridge University Press, Cambridge (1974)"},{"key":"17_CR10","volume-title":"Introduction to Riesz Spaces","author":"E De Jonge","year":"1977","unstructured":"De Jonge, E., Van Rooij, A.C.M.: Introduction to Riesz Spaces, vol. 78. Mathematical Centre Tracts, Amsterdam (1977)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-030-17127-8_24","volume-title":"Foundations of Software Science and Computation Structures","author":"C Lucas","year":"2019","unstructured":"Lucas, C., Mio, M.: Towards a structural proof theory of probabilistic $$\\mu $$-calculi. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 418\u2013435. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_24"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Lucas, C., Mio, M.: Proof theory of Riesz spaces and modal Riesz spaces. In: Logical Methods in Computer Science (2021)","DOI":"10.46298\/lmcs-18(1:32)2022"},{"key":"17_CR13","unstructured":"Lucas, C.: A complete Coq formalisation (2021). https:\/\/doi.org\/10.5281\/zenodo.4897186"},{"key":"17_CR14","volume-title":"Riesz Spaces","author":"WAJ Luxemburg","year":"1971","unstructured":"Luxemburg, W.A.J., Zaanen, A.C.: Riesz Spaces, vol. 1. North-Holland Mathematical Library, Amsterdam (1971)"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Mio, M., Furber, R., Mardare, R.: Riesz modal logic for Markov processes. In: 32nd ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312. IEEE (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005091","DOI":"10.1109\/LICS.2017.8005091"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Mio, M.: Riesz modal logic with threshold operators. In: 33rd Symposium on Logic in Computer Science (LICS), pp. 710\u2013719. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209118","DOI":"10.1145\/3209108.3209118"},{"key":"17_CR17","series-title":"Applied Logic Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9409-5","volume-title":"Proof Theory for Fuzzy Logics","author":"G Metcalfe","year":"2009","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.M.: Proof Theory for Fuzzy Logics. Applied Logic Series, vol. 36. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-1-4020-9409-5"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Mio, M., Simpson, A.: \u0141ukasiewicz $$\\mu $$-calculus. Fundam. Inf. 150(3\u20134), 317\u2013346 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1472","DOI":"10.3233\/FI-2017-1472"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88701-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T14:36:38Z","timestamp":1699713398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88701-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030887001","9783030887018"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88701-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marseille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics19.lis-lab.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}