{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:03Z","timestamp":1725460023649},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582770"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0049321","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T13:58:16Z","timestamp":1141653496000},"page":"18-32","source":"Crossref","is-referenced-by-count":0,"title":["On duality for the modal \u03bc-calculus"],"prefix":"10.1007","author":[{"given":"Simon","family":"Ambler","sequence":"first","affiliation":[]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Measor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1111\/j.1755-2567.1974.tb00076.x","volume":"40","author":"K. Fine","year":"1974","unstructured":"K. Fine. An incomplete logic containing S4. Theoria, 40:23\u201329, 1974.","journal-title":"Theoria"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"2_CR3","unstructured":"G. Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen. North-Holland, 1969."},{"key":"2_CR4","first-page":"41","volume":"6","author":"R. Goldblatt","year":"1976","unstructured":"R. Goldblatt. Metamathematics of modal logic. Reports on Mathematical Logic, 6 and 7:41\u201378 and 21\u201352, 1976.","journal-title":"Reports on Mathematical Logic"},{"key":"2_CR5","unstructured":"P. Halmos. Algebraic Logic. Chelsea, New York, 1962."},{"key":"2_CR6","unstructured":"P. T. Johnstone. Stone Spaces. Cambridge University Press, 1982."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u03bc-calculus. Theoretical Computer Science, 27:333\u2013353, 1983.","journal-title":"Theoretical Computer Science"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D. Kozen","year":"1988","unstructured":"D. Kozen. A finite model theorem for the propositional \u03bc-calculus. Studia Logica, 47:233\u2013241, 1988.","journal-title":"Studia Logica"},{"issue":"7","key":"2_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0950-5849(89)90159-6","volume":"31","author":"M. Z. Kwiatkowska","year":"1989","unstructured":"M. Z. Kwiatkowska. Survey of fairness notions. Information and Software Technology, 31(7):371\u2013386, 1989.","journal-title":"Information and Software Technology"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"K. Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72, 1990.","DOI":"10.1016\/0304-3975(90)90038-J"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","volume":"14","author":"J.-L. Lassez","year":"1982","unstructured":"J.-L. Lassez, V. Nguyen, and E. Sonenberg. Fixed point theorems and semantics: A folk tale. Information Processing Letters, 14(3):112\u2013116. 1982.","journal-title":"Information Processing Letters"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"D. Niwinski. On fixed-point clones. In L. Kott, editor, Automata. Languages and Programming, volume 226 of Lecture Notes in Computer Science Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"D. Park. On the semantics of fair parallelism. In D. Bjorner, editor, Abstract Software Specifications, volume 86 of Lecture Notes in Computer Science, pages 504\u2013526. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10007-5_47"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0168-0072(88)90021-8","volume":"37","author":"G. Sambin","year":"1988","unstructured":"G. Sambin and V. Vaccaro. Topology and duality in modal logic. Annals of Pure and Applied Logic, 37:249\u2013296, 1988.","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"R. Sikorski. Boolean algebras. Springer-Verlag, third edition, 1969.","DOI":"10.1007\/978-3-642-85820-8"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"C. Stirling and D. Walker. Local model checking in the propositional \u03bc-calculus. volume 351 of Lecture Notes in Computer Science, pages 369\u2013383. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-50939-9_144"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1755-2567.1974.tb00077.x","volume":"40","author":"S. Thomason","year":"1974","unstructured":"S. Thomason. An incompleteness theorem in modal logic. Theoria, 40:30\u201334, 1974.","journal-title":"Theoria"},{"key":"2_CR18","unstructured":"I. Walukiewicz. On the completeness of \u03bc-calculus. To appear in LICS'93, 1993."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049321.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:55:37Z","timestamp":1607532937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582770"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0049321","relation":{},"subject":[]}}