{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:50:32Z","timestamp":1776271832234,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678953","type":"print"},{"value":"9783540446224","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44622-2_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:32:38Z","timestamp":1187253158000},"page":"277-291","source":"Crossref","is-referenced-by-count":13,"title":["Sequents, Frames, and Completeness"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]},{"given":"Guo-Qiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung, Domain theory, in: Handbook of Logic in Computer Science, Vol 3, (Clarendon Press, 1995).","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004100011464","volume":"29","author":"G. Birkho","year":"1933","unstructured":"G. Birkho.. On the combination of subalgebras. Proc. Camb. Philos. Soc. 29, 441\u2013464, 1933.","journal-title":"Proc. Camb. Philos. Soc"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"J. Cederquist and Th. Coquand. Entailment relations and distributive lattices. To appear in the Proceedings of Logic Colloquium 98.","DOI":"10.1017\/9781316756140.011"},{"key":"18_CR4","unstructured":"Th. Coquand and H. Persson. Valuations and Dedekind Prague Theorem. To appear in the Journal of Pure and Applied Logic."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(90)90097-2","volume":"75","author":"M. Droste","year":"1990","unstructured":"M. Droste and R. G\u00f6bel. Non-deterministic information systems and their domains. Theoretical Computer Science 75, 289\u2013309, 1990.","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","first-page":"107","volume-title":"L. E. J. Brouwer Centenary Symposium (Noordwijkerhout","author":"M. F. R. Grayson","year":"1981","unstructured":"M. Fourman, R. Grayson. Formal Spaces. in L. E. J. Brouwer Centenary Symposium (Noordwijkerhout, 1981), 107\u2013122, North-Holland, Amsterdam-New York, 1982."},{"key":"18_CR7","unstructured":"P. Johnstone. Stone Spaces. Cambridge University Press, 1982."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.3233\/FI-1999-37403","volume":"37","author":"A. Jung","year":"1999","unstructured":"A. Jung, M.A.M. Moshier and M. Kegelmann. Multi lingual sequent calculus and coherent spaces. Fundamenta Informaticae, vol 37, 1999, pages 369\u2013412.","journal-title":"Fundamenta Informaticae"},{"key":"18_CR9","unstructured":"G. Gentzen Collected Works. Edited by Szabo, Not-Holland, 1969."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.2307\/2042394","volume":"79","author":"V. Lifschitz","year":"1980","unstructured":"V. Lifschitz. Semantical completeness theorems in logic and algebra. Proc. Am. Math. Soc., vol. 79, 1980, p. 89\u201396.","journal-title":"Proc. Am. Math. Soc."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"S. MacLane, Categories for the working mathematician. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"18_CR12","first-page":"77","volume":"3","author":"J.A. Robinson","year":"1968","unstructured":"J.A. Robinson. The generalised resolution principle. Machine Intelligence, vol. 3, p. 77\u201393. 1968.","journal-title":"Machine Intelligence"},{"key":"18_CR13","unstructured":"W. Rounds and G.-Q. Zhang. Clausal logic and logic programming in algebraic domains. Submitted. Copy at: http:\/\/www.cs.uga.edu\/~gqz"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"861","DOI":"10.2307\/2275761","volume":"60","author":"G. Sambin","year":"1995","unstructured":"G. Sambin. Pretopologies and completeness proofs. J. Symbolic Logic 60 (1995), no. 3, 861\u2013878.","journal-title":"J. Symbolic Logic"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"D. Scott. Completeness and axiomatizability. Proceedings of the Tarski Symposium, 1974, p. 411\u2013435.","DOI":"10.1090\/pspum\/025\/0363802"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"D. Scott. Background to formalisation. in Truth, Syntax and Modality, H. Leblanc, ed., p. 411\u2013435, 1973.","DOI":"10.1016\/S0049-237X(08)71542-8"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"D. Scott. On engendring an illusion of understanding. Journal of Philosophy, p. 787\u2013807, 1971.","DOI":"10.2307\/2024952"},{"key":"18_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata,Languages and Programing","author":"D. Scott","year":"1982","unstructured":"D. Scott. Domains for denotational semantics. in: Lecture Notes in Computer Science 140, 577\u2013613, 1982."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.2307\/1989664","volume":"40","author":"M. H. Stone","year":"1936","unstructured":"M. H. Stone. The theory of representations for Boolean algebras. Trans. Amer. Math. Soc. 40, 37\u2013111, 1936.","journal-title":"Trans. Amer. Math. Soc"},{"key":"18_CR20","unstructured":"A. Tarski. Logic, semantics, metamathematics. Oxford, 1956."},{"key":"18_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0445-9","volume-title":"Logic of Domains","author":"G.-Q. Zhang","year":"1991","unstructured":"G.-Q. Zhang. Logic of Domains. Birkhauser Boston, Inc., Boston, MA, 1991."},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-55719-9_81","volume-title":"19th International Colloquium on Automata, Languages, and Programming (ICALP\u201992)","author":"G.-Q. Zhang","year":"1992","unstructured":"G.-Q. Zhang. Disjunctive systems and L-domains. 19th International Colloquium on Automata, Languages, and Programming (ICALP\u201992), Lecture Notes in Computer Science 623, 1992, pp. 284\u2013295."},{"key":"18_CR23","unstructured":"G.-Q. Zhang and W. C. Rounds. An information-system representation of the Smyth powerdomain. International Symposium on Domain Theory. Shanghai, China, October 1999. Copy at: http:\/\/www.cs.uga.edu\/~gqz"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44622-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T12:12:27Z","timestamp":1708171947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}