Weakly complete axiomatization of exogenous quantum propositional logic

Authors:
P. Mateus;A. Sernadas
Affiliations:
CLC, Department of Mathematics, IST, Lisboa, Portugal;CLC, Department of Mathematics, IST, Lisboa, Portugal
Venue:
Information and Computation
Year:
2006

Citing 8
Cited 3

Probabilistic logic

Artificial Intelligence
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities

Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Computability: a mathematical sketchbook

Computability: a mathematical sketchbook
Decidability and expressiveness for first-order logics of probability

Information and Computation
Quantum computation and quantum information

Quantum computation and quantum information
On probability distributions over possible worlds

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Knowledge in quantum systems

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge

Quantum programming languages: survey and bibliography

Mathematical Structures in Computer Science
Reasoning about probabilistic sequential programs

Theoretical Computer Science
Probabilistic Logic over Paths

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A finitary axiomatization for exogenous quantum propositional logic is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical reasoning. The proof is carried out using a non-trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin style completions.