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

Theoretical and Mathematical Physics

A theorem about states on quantum logics

M. S. Matveichuk

Published Nov 1, 1980• 2 citations
Publisher
DOI
10.1007/bf01028598

Related papers

A theorem about states on quantum logics. II

M. S. Matveichuk

Theoretical and Mathematical Physics•Aug 1, 1981•1 citation

A theorem about states on quantum logics. States on Jordan algebras

M. S. Matveichuk

Theoretical and Mathematical Physics•Dec 1, 1983•3 citations

A generalized characterization theorem for quantum logics

M. K. Mukherjee

Lettere al nuovo cimento della societa italiana di fisica/Lettere al nuovo cimento•Aug 1, 1984•2 citations

On the representation theorem for quantum logic

Krystyna Bugajska

International Journal of Theoretical Physics•Feb 1, 1974•5 citations

Quantum logic and a theorem on commensurability

Wawrzyniec Guz

Reports on Mathematical Physics•Mar 1, 1971•4 citations

Foundations of logic programming in hybrid-dynamic quantum logic

Daniel Găină

The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natural way based on concepts advanced in (hybrid and dynamic) modal logics. We then study Horn clauses in the hybrid-dynamic quantum logic proposed, and develop a series of results that lead to an initial semantics theorem for sets of clauses that are satisfiable. This shows that a significant fragment of hybrid-dynamic quantum logic has good computational properties, and can serve as a basis for defining executable languages for specifying quantum programs. We set the foundations of logic programming in this fragment by proving a variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable substitution.

arXiv:2406.02085•Jun 4, 2024•2 citations
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natural way based on concepts advanced in (hybrid and dynamic) modal logics. We then study Horn clauses in the hybrid-dynamic quantum logic proposed, and develop a series of results that lead to an initial semantics theorem for sets of clauses that are satisfiable. This shows that a significant fragment of hybrid-dynamic quantum logic has good computational properties, and can serve as a basis for defining executable languages for specifying quantum programs. We set the foundations of logic programming in this fragment by proving a variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable substitution.