Journal article

A Categorical Quantum Logic

Abstract:: We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Abramsky, S., & Duncan, R. (2006). A Categorical Quantum Logic. Mathematical Structures in Computer Science, 16(3), 469–489.

MLA Style

Abramsky, S., and R. Duncan. “A Categorical Quantum Logic.” Mathematical Structures in Computer Science, vol. 16, no. 3, 2006, pp. 469–89.

Chicago Style

Abramsky, S, and R Duncan. 2006. “A Categorical Quantum Logic.” Mathematical Structures in Computer Science 16 (3): 469–89.
Share
Print

Access Document

Files:: 0512114v1.pdf

(Preview, pdf, 259.7KB, Terms of use)

Publisher copy:: 10.1017/S0960129506005275

Authors

+ Abramsky, S More by this author

Role:: Author

+ Duncan, R More by this author

Role:: Author

Journal:: Mathematical Structures in Computer Science More from this journal
Volume:: 16
Issue:: 3
Pages:: 469-489
Publication date:: 2006-01-01
DOI:: 10.1017/S0960129506005275

UUID:: uuid:702a4b24-0987-4e01-8135-78d52e9d9b68
Local pid:: cs:3313
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2006

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP