Abstract
The results presented in this paper wereobtained in the framework of basic logic, a new logicaiming at the unification of several logical systems.The first result is a sequent formulation for orthologic which allows the use of methods of proof theoryin quantum logic. Such a formulation admits a verysimple procedure of cut-elimination and hence, becauseof the subformula property, also a method of proof search and an effective decision procedure. Byusing the framework of basic logic, we also obtain acut-free formulation for orthologic with implication,for linear orthologic, and, more in generally for a wide range of new quantum-like logics. Theselogics meet some requirements expressed by physicistsand computer scientists. In particular, we propose agood candidate for a linear quantum logic withimplication.
Similar content being viewed by others
REFERENCES
Battilotti, G., and Sambin, G. (1996). Basic logic and the cube of its extensions, in Logic and Scientific Methods, M. L. Dalla Chiara, K. Doets, D. Mundici, and J. van Benthem, eds., Kluver, Dordrecht, to appear.
Battilotti, G., Faggian, C., and Sambin, G. (1996). Basic logic: reflection, symmetry, visibility, to appear.
Cutland, N. J., and Gibbins, P. F. (1982). A regular sequent calculus for quantum logic in which ⋀ and ⋁ are dual, Logique et Analyse Nouvelle Serie, 25, 221–248.
Dalla Chiara, M. L., and Giuntini, R. (1989). Paraconsistent quantum logics, Foundations of Physics, 19, 891–904.
Dummett, M. (1976). Introduction to quantum logic, unpublished notes.
Faggian, C. (1996). Basic logic and Girard's negation: A new approach to orthologic, to be submitted.
Gentzen, G. (1935). Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, 39, 176–210. English translation in The Collected Papers of Gerhard Gentzen, M. E. Szabo, ed., North-Holland, Amsterdam (1969), pp. 68–131.
Girard, J.-Y. (1987), Linear logic, Theoretical Computer Science, 50, 1–102.
Lincoln, P. D., Mitchell, J., Scedrov, A., and Shankar, N. (1990). Decision problems for propositional linear logic, in Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 239–311.
Nishimura, H. (1980). Sequential method in quantum logic, Journal of Symbolic Logic, 45, 339–352.
Nishimura, H. (1994). Proof theory for minimal quantum logic. I, II, International Journal of Theoretical Physics, 33, 103–113, 1427–1443.
Pratt, V. (1993). Linear logic for generalized quantum mechanics, in Proceedings Workshop on Physics and Computation (PhysComp'92), Dallas, IEEE, pp. 166–180.
Takano, M. (1995). Proof theory for minimal quantum logic: A remark, International Journal of Theoretical Physics, 34, 649–654.
Tamura, S. (1988). A Gentzen formulation without the cut rule for ortholattices, Kobe Journal of Mathematics, 5, 133–150.
Rights and permissions
About this article
Cite this article
Faggian, C., Sambin, G. From Basic Logic to Quantum Logics with Cut-Elimination. International Journal of Theoretical Physics 37, 31–37 (1998). https://doi.org/10.1023/A:1026652903971
Issue Date:
DOI: https://doi.org/10.1023/A:1026652903971