Proof theory for minimal quantum logic I
- Cite this article as:
- Nishimura, H. Int J Theor Phys (1994) 33: 103. doi:10.1007/BF00671616
- 72 Downloads
In this paper we give a sequential system of minimal quantum logic which enjoys cut-freeness naturally. The duality theorem, the cut-elimination theorem, and the completeness theorem with respect to the relational semantics of R. I. Goldblatt are presented. Due to severe limitations of space, technically heavy proofs of the first two theorems are relegated to a subsequent paper.