{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:55:32Z","timestamp":1774436132030,"version":"3.50.1"},"reference-count":7,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":3206,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p><jats:bold>\u00a71. Introduction<\/jats:bold>. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and \u03bb-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection.<\/jats:p><jats:p>The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space \u210d in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit \u2102<jats:sup>2<\/jats:sup>. (Actually the qubit is merely a convenience.<\/jats:p>","DOI":"10.2178\/jsl\/1120224716","type":"journal-article","created":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T11:00:39Z","timestamp":1120215639000},"page":"353-359","source":"Crossref","is-referenced-by-count":14,"title":["Quantum logic as motivated by quantum computing"],"prefix":"10.1017","volume":"70","author":[{"given":"J. Michael","family":"Dunn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias J.","family":"Hagge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenghan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200006952_ref001","doi-asserted-by":"publisher","DOI":"10.2307\/1968621"},{"key":"S0022481200006952_ref006","volume-title":"Quantum logic in algebraic approach","volume":"91","author":"Redli","year":"1998"},{"key":"S0022481200006952_ref005","first-page":"676","volume-title":"Quantum computation and quantum information","author":"Nielsen","year":"2000"},{"key":"S0022481200006952_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(73)90001-X"},{"key":"S0022481200006952_ref003","volume-title":"Lattice theory: First concepts and distributive lattices","author":"Gratzfer","year":"1981"},{"key":"S0022481200006952_ref007","volume-title":"A decision method for elementary algebra and geometry","author":"Tarski","year":"1948"},{"key":"S0022481200006952_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0460-1_2"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200006952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:50:29Z","timestamp":1556902229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200006952\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["S0022481200006952"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1120224716","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}