{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T17:49:11Z","timestamp":1714412951095},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0020-0190(00)00176-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:16Z","timestamp":1027607296000},"page":"57-63","source":"Crossref","is-referenced-by-count":3,"title":["On the antisymmetry of Galois embeddings"],"prefix":"10.1016","volume":"79","author":[{"given":"J.","family":"Burghardt","sequence":"first","affiliation":[]},{"given":"F.","family":"Kamm\u00fcller","sequence":"additional","affiliation":[]},{"given":"J.W.","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(00)00176-9_BIB001","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0020-0190(98)00107-0","article-title":"Pair algebras and Galois connections","volume":"67","author":"Backhouse","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00176-9_BIB002","series-title":"Isomorphism of Galois embeddings","author":"Burghardt","year":"2000"},{"key":"10.1016\/S0020-0190(00)00176-9_BIB003","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","volume":"4","author":"Cousot","year":"1977","journal-title":"POPL"},{"issue":"3","key":"10.1016\/S0020-0190(00)00176-9_BIB004","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(94)00194-4","article-title":"Constructing the Galois adjoint","volume":"53","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00176-9_BIB005","series-title":"Elements of Set Theory","author":"Enderton","year":"1977"},{"issue":"4","key":"10.1016\/S0020-0190(00)00176-9_BIB006","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01212407","article-title":"A single complete rule for data refinement","volume":"5","author":"Gardiner","year":"1993","journal-title":"Formal Aspects of Computing"},{"issue":"4","key":"10.1016\/S0020-0190(00)00176-9_BIB007","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0019-9958(64)90181-0","article-title":"Pair algebras and their application to automata theory","volume":"7","author":"Hartmanis","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(00)00176-9_BIB008","series-title":"Unifying Theories of Programming","author":"Hoare","year":"1998"},{"issue":"3","key":"10.1016\/S0020-0190(00)00176-9_BIB009","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00205-D","article-title":"Sequential calculus","volume":"53","author":"von Karger","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00176-9_BIB010","unstructured":"A.K. McIver, C.C. Morgan, J.W. Sanders, Programs and abstraction, Draft manuscript available by ftp.comlab.ox.ac.uk at \/tmp\/Jeff.Sanders\/w2.ps"},{"key":"10.1016\/S0020-0190(00)00176-9_BIB011","first-page":"299","article-title":"Galois connections and computer science applications","volume":"240","author":"Melton","year":"1986"},{"key":"10.1016\/S0020-0190(00)00176-9_BIB012","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(94)00123-Z","article-title":"Lagois connections\u2014a counterpart to Galois connections","volume":"136","author":"Melton","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00176-9_BIB013","series-title":"Communication and Concurrency","author":"Milner","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001769?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001769?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:24:01Z","timestamp":1556439841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0020019000001769"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00176-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}