Conference item

A Categorical Quantum Logic

Abstract:: We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with a strongly normalising cut-elimination. This syntax encodes abstract qualitative and quantitative information about the behaviour of 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. (2004). A Categorical Quantum Logic. Proceedings of the 2nd International Workshop on Quantum Programming Languages, 33.

MLA Style

Abramsky, S., and R. Duncan. “A Categorical Quantum Logic.” Proceedings of the 2nd International Workshop on Quantum Programming Languages, vol. 33, 2004.

Chicago Style

Abramsky, S, and R Duncan. 2004. “A Categorical Quantum Logic.” In Proceedings of the 2nd International Workshop on Quantum Programming Languages. Vol. 33.
Share
Print

Authors

+ Abramsky, S More by this author

Role:: Author

+ Duncan, R More by this author

Role:: Author

Host title:: Proceedings of the 2nd International Workshop on Quantum Programming Languages
Volume:: 33
Publication date:: 2004-01-01

UUID:: uuid:70c574f0-02a9-49f8-b555-c81342f8e1fb
Local pid:: cs:3318
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2004

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