Weakly complete axiomatization of exogenous quantum propositional logic

DOI10.1016/j.ic.2006.02.001zbMath1116.03021arXivmath/0503453OpenAlexW2147119042WikidataQ59196691 ScholiaQ59196691MaRDI QIDQ2495653

Paulo Mateus, Amílcar Sernadas

Publication date: 30 June 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0503453

zbMATH Keywords

quantum logicprobability logicquantum modelsexogenous quantum logic

Mathematics Subject Classification ID

Quantum computation (81P68) Other nonclassical logic (03B60) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Related Items (18)

Reasoning about probabilistic sequential programs ⋮ Importing logics: soundness and completeness preservation ⋮ Model-Checking Linear-Time Properties of Quantum Systems ⋮ Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs ⋮ QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS ⋮ Toward automatic verification of quantum programs ⋮ Classical logic and quantum logic with multiple and common lattice models ⋮ Wave-particle duality and the objectiveness of ``true and ``false ⋮ Probabilistic Logic over Paths ⋮ Probabilization of logics: completeness and decidability ⋮ Importing logics ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ Fibring as biporting subsumes asymmetric combinations ⋮ Temporalization of Probabilistic Propositional Logic ⋮ Behavioral algebraization of logics ⋮ A quantum-BDI model for information processing and decision making ⋮ A Process Algebra for Reasoning About Quantum Security ⋮ Exogenous Probabilistic Computation Tree Logic

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logic
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• Reasoning in quantum theory. Sharp and unsharp quantum logics.
• Semantics of the minimal logic of quantum mechanics
• Probabilistic logic revisited
• Computer Science Logic
• Logics in Artificial Intelligence
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Completeness in the theory of types

This page was built for publication: Weakly complete axiomatization of exogenous quantum propositional logic