{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:36Z","timestamp":1725544596134},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734673_11","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"134-146","source":"Crossref","is-referenced-by-count":7,"title":["Relational Correspondences for Lattices with Operators"],"prefix":"10.1007","author":[{"given":"Jouni","family":"J\u00e4rvinen","sequence":"first","affiliation":[]},{"given":"Ewa","family":"Or\u0142owska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W. Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen uber des Eliminationsproblem der mathematischen Logik. Mathematische Annalen\u00a0110, 390\u2013413 (1935)","journal-title":"Mathematische Annalen"},{"key":"11_CR2","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04997-6","volume-title":"Incomplete Information: Structure, Inference, Complexity","author":"S. Demri","year":"2002","unstructured":"Demri, S., Or\u0142owska, E.: Incomplete Information: Structure, Inference, Complexity. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-7908-1828-4_16","volume-title":"Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing","author":"I. D\u00fcntsch","year":"2001","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: Beyond modalities: sufficiency and mixed algebras. In: Or\u0142owska, E., Sza\u0142as, A. (eds.) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol.\u00a065, pp. 263\u2013285. Physica-Verlag, Heidelberg (2001)"},{"key":"11_CR4","first-page":"132","volume":"1","author":"I. D\u00fcntsch","year":"2005","unstructured":"D\u00fcntsch, I., Or\u0142owska, E., Radzikowska, A., Vakarelov, D.: Relational representation theorems for some lattice-based structures. Journal of Relational Methods in Computer Science\u00a01, 132\u2013160 (2005)","journal-title":"Journal of Relational Methods in Computer Science"},{"key":"11_CR5","first-page":"89","volume-title":"Logic at Work. Essays dedicated to the memory of Helena Rasiowa","author":"A. Nonnengart","year":"1999","unstructured":"Nonnengart, A., Sza\u0142as, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In: Or\u0142owska, E. (ed.) Logic at Work. Essays dedicated to the memory of Helena Rasiowa, pp. 89\u2013108. Physica-Verlag, Heidelberg (1999)"},{"key":"11_CR6","first-page":"147","volume-title":"Proceedings of the 12th International Congress on Logic, Methodology and Philosophy of Science","author":"E. Or\u0142owska","year":"2005","unstructured":"Or\u0142owska, E., Vakarelov, D.: Lattice-based modal algebras and modal logics. In: H\u00e1jek, P., Valdes-Villanueva, L., Westerstahl, D. (eds.) Proceedings of the 12th International Congress on Logic, Methodology and Philosophy of Science, pp. 147\u2013170. KCL Publications, London (2005)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1093\/jigpal\/jzi035","volume":"13","author":"E. Or\u0142owska","year":"2005","unstructured":"Or\u0142owska, E., Rewitzky, I.: Duality via truth: semantic frameworks for lattice-based logics. Logic Journal of the IGPL\u00a013, 467\u2013490 (2005)","journal-title":"Logic Journal of the IGPL"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Relational semantics through duality. In: D\u00fcntsch, I., Winter, M. (eds.) Proceedings of the Eighth International Conference on Relational Methods in Computer Science (RelMiCS), vol.\u00a08, p. 187. Department of Computer Science, Brock University (2005)","DOI":"10.1007\/11734673_2"},{"key":"11_CR9","first-page":"110","volume-title":"Third Scandinavian Logic Symposium, Uppsala, Sweden, 1973","author":"H. Sahlqvist","year":"1975","unstructured":"Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logics. In: Kanger, S. (ed.) Third Scandinavian Logic Symposium, Uppsala, Sweden, 1973, pp. 110\u2013143. North Holland, Amsterdam (1975)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/3.6.605","volume":"3","author":"A. Sza\u0142as","year":"1993","unstructured":"Sza\u0142as, A.: On the correspondence between modal and classical logic: an automated approach. Journal of Logic and Computation\u00a03, 605\u2013620 (1993)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02485369","volume":"8","author":"A. Urquhart","year":"1978","unstructured":"Urquhart, A.: A topological representation theory for lattices. Algebra Universalis\u00a08, 45\u201358 (1978)","journal-title":"Algebra Universalis"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-94-009-6259-0_4","volume-title":"Handbook of Philosophical Logic","author":"J. Benthem van","year":"1984","unstructured":"van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a0II, pp. 167\u2013247. Reidel, Dordrecht (1984)"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T22:32:47Z","timestamp":1683498767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11734673_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}