{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:19:40Z","timestamp":1772252380509,"version":"3.50.1"},"reference-count":19,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T00:00:00Z","timestamp":1550966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. However, what happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum registers measurements? This paper gives an answer to this question, and, quite surprisingly, shows that such a logic is nothing else that the standard propositional intuitionistic logic.<\/jats:p>","DOI":"10.3390\/axioms8010025","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:06:52Z","timestamp":1551064012000},"page":"25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Logic for Quantum Register Measurements"],"prefix":"10.3390","volume":"8","author":[{"given":"Andrea","family":"Masini","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Verona, 37134 Verona, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3285-9827","authenticated-orcid":false,"given":"Margherita","family":"Zorzi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Verona, 37134 Verona, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"823","DOI":"10.2307\/1968621","article-title":"The logic of quantum mechanics","volume":"37","author":"Birkhoff","year":"1936","journal-title":"Ann. Math."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Gabbay, D., and Guenthner, F. (1986). Quantum Logic. Handbook of Philosophical Logic: Volume III: Alternatives to Classical Logic, Springer.","DOI":"10.1007\/978-94-009-5203-4"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","article-title":"Simulating physics with computers","volume":"21","author":"Feynman","year":"1981\/82","journal-title":"Internat. J. Theoret. Phys."},{"key":"ref_4","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press. [10th Anniversary ed.]."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1017\/S0960129506005238","article-title":"A lambda calculus for quantum computation with classical control","volume":"16","author":"Selinger","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.entcs.2011.01.006","article-title":"Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits","volume":"270","author":"Arrighi","year":"2011","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Pagani, M., Selinger, P., and Valiron, B. (2014, January 22\u201324). Applying quantitative semantics to higher-order quantum computing. Proceedings of the POPL\u201914, San Diego, CA, USA.","DOI":"10.1145\/2535838.2535879"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1017\/S0960129514000425","article-title":"On quantum lambda calculi: A foundational perspective","volume":"26","author":"Zorzi","year":"2016","journal-title":"Math. Struct. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., and Yokoyama, T. (2013). Tutorial: Graphical Calculus for Quantum Circuits, Springer Berlin Heidelberg. Reversible Computation.","DOI":"10.1007\/978-3-642-36315-3"},{"key":"ref_10","unstructured":"Dal Lago, U., and Zorzi, M. (2014, January 13). Wave-Style Token Machines and Quantum Lambda Calculi. Proceedings of the Third International Workshop on Linearity (LINEARITY 2014), Vienna, Austria. Electronic Proceedings in Theoretical Computer Science."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Paolini, L., and Zorzi, M. (2017, January 20\u201322). qPCF: A language for quantum circuit computations. Proceedings of the Theory and Applications of Models of Computation\u201414th Annual Conference, TAMC 2017, Bern, Switzerland. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-319-55911-7_33"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1017\/S0960129506005275","article-title":"A categorical quantum logic","volume":"16","author":"Abramsky","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s11229-010-9783-6","article-title":"Quantum logic as a dynamic logic","volume":"179","author":"Baltag","year":"2011","journal-title":"Synthese"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1017\/S0960129506005299","article-title":"LQP: the dynamic logic of quantum information","volume":"16","author":"Baltag","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"key":"ref_15","first-page":"475","article-title":"Modal deduction systems for quantum state transformations","volume":"17","author":"Masini","year":"2011","journal-title":"J. Mult.-Valued Logic Soft Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Vigan\u00f2, L., Volpe, M., and Zorzi, M. (2014, January 1\u20134). Quantum State Transformations and Branching Distributed Temporal Logic\u2014(Invited Paper). Proceedings of the Logic, Language, Information, and Computation\u201421st International Workshop (WoLLIC 2014), Valpara\u00edso, Chile. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-662-44145-9_1"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.ic.2017.01.007","article-title":"A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations","volume":"255","author":"Volpe","year":"2017","journal-title":"Inf. Comput."},{"key":"ref_18","unstructured":"Girard, J.Y. (1987). Proof Theory and Logical Complexity, Bibliopolis. Studies in Proof Theory. Monographs."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1305\/ndjfl\/1040046087","article-title":"Combining Temporal Logic Systems","volume":"37","author":"Finger","year":"1996","journal-title":"Notre Dame J. Formal Logic"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/1\/25\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:34:28Z","timestamp":1760186068000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/1\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,24]]},"references-count":19,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["axioms8010025"],"URL":"https:\/\/doi.org\/10.3390\/axioms8010025","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201811.0226.v1","asserted-by":"object"}]},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,24]]}}}