Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Studia Logica

An extension of the Łukasiewicz logic to the modal logic of quantum mechanics

Herman Dishkant

Published Jun 1, 1978• 7 citations
Publisher
DOI
10.1007/bf02124800

Related papers

Partial quantum logics and Łukasiewicz’ quantum logic

M. Dalla Chiara, Roberto Giuntini, Richard J. Greechie

Trends in logic•Jan 1, 2004•0 citations

Fuzzy Sets and Infinite-Valued Łukasiewicz Logic in Foundations of Quantum Mechanics

Jarosław Pykacz

Springer eBooks•Jan 1, 1995•0 citations

Towards a logic of modalities for quantum mechanics

Olímpia Lombardi, Matías Daniel Pasqualini, Juan Pablo Jorge +1 more

•Jan 1, 2025•0 citations

The modal logic of quantum logic

Peter Mittelstaedt

Journal of Philosophical Logic•Jan 1, 1979•20 citations

Product Łukasiewicz Quantum Logic

Cesarino Bertini, Roberto Leporini

International Journal of Theoretical Physics•Nov 26, 2010•0 citations

An Error Correctable Implication Algebra for a System of Qubits

Morrison Turnansky

We present the Lukasiewicz logic as a viable system for an implication algebra on a system of qubits. Our results show that the three valued Lukasiewicz logic can be embedded in the stabilized space of an arbitrary quantum error correcting stabilizer code. We then fully characterize the non trivial errors that may occur up to group isomorphism. Lastly, we demonstrate by explicit algorithmic example, how any algorithm consistent with the Lukasiewicz logic can immediately run on a quantum system and utilize the indeterminate state.

quant-pharXiv:2511.14797•Nov 18, 2025•0 citations
We present the Lukasiewicz logic as a viable system for an implication algebra on a system of qubits. Our results show that the three valued Lukasiewicz logic can be embedded in the stabilized space of an arbitrary quantum error correcting stabilizer code. We then fully characterize the non trivial errors that may occur up to group isomorphism. Lastly, we demonstrate by explicit algorithmic example, how any algorithm consistent with the Lukasiewicz logic can immediately run on a quantum system and utilize the indeterminate state.