Weakly complete axiomatization of exogenous quantum propositional logic
This paper apparently builds on earlier work by the same authors who have already proposed ``a new logic (EQPL -- exogenous quantum propositional logic) for modelling and reasoning about quantum systems, embodying all that is stated in the postulates of quantum physics (p. 771). The logic was designed ``from the semantics upwards starting with the key idea of adopting superpositions of classical models as the models of the proposed quantum logic (ibid.). So in contrast to ``quantum logic in the tradition of von Neumann and Birkhoff, where the lattice operations of Hilbert Space generate new quantum propositional connectives, here classical logic is extended by valuation structures that are derived from ``a finitary Hilbert calculus for EQPL (p. 772). At heart is the notion that unit vectors \(|\Psi\rangle\) representing quantum states are acted on by classical valuations \(v\) to produce ``logical amplitudes of \(|\Psi\rangle\) for \(v\) given by the inner product of \(v\) and \(|\Psi\rangle\). Section 2, ``Key design ideas, gives a clear informal discussion of the ``quantum postulates derived from Hilbert space, and uses this discussion to introduce key features of the semantics. By loose analogy with Kripke methods, valuations of EQPL are derived from a ``quantum intepretation structure \(w = (V,S,|\Psi\rangle,v)\). \(V\) contains ``admissable classical valuations, \(S\) is a finite partition over \(V\), \(|\Psi\rangle\) is a quantum state, i.e., a unit vector of the Hilbert space, and \(v\) is a mapping defined so as to provide the means for interpreting amplitude terms, ``even when they are physically undefined, avoiding the need for ``partial interpretation structures (p. 775). A finite probability space is then associated with each such interpretation structure in a way that allows probabilities to be assigned in a given quantum state, to the truth of classical propositions (p. 776). The structures introduced informally in Section 2 are elaborated and developed in Part 3, ``Language and semantics. Unfortunately the symbolism may be unfamiliar to traditional logicians, who would have been helped by a few key definitions. Part 4, ``Axiomatisation, introduces the notion of quantum tautology and provides a finitary axiomatisation of the computational logic using two rules and fifteen axiom schemas, including an analytical oracle. Finally in Part 5 the proof of bounded weak completeness is presented ``using a non-trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin like completions (p. 791).
- A logic for reasoning about probabilities
- Completeness in the theory of types
- Computer Science Logic
- Decidability and expressiveness for first-order logics of probability
- Exogeneous semantics approach to enriching logics
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 6688177 (Why is no real title available?)
- scientific article; zbMATH DE number 530148 (Why is no real title available?)
- scientific article; zbMATH DE number 1735924 (Why is no real title available?)
- scientific article; zbMATH DE number 1361518 (Why is no real title available?)
- scientific article; zbMATH DE number 3206304 (Why is no real title available?)
- scientific article; zbMATH DE number 3235679 (Why is no real title available?)
- Logics in Artificial Intelligence
- Probabilistic logic
- Probabilistic logic revisited
- Reasoning in quantum theory. Sharp and unsharp quantum logics.
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Semantics of the minimal logic of quantum mechanics
- Behavioral algebraization of logics
- Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs
- Wave-particle duality and the objectiveness of ``true and ``false
- Probabilization of logics: completeness and decidability
- Fibring as biporting subsumes asymmetric combinations
- A quantum-BDI model for information processing and decision making
- Reasoning about probabilistic sequential programs
- A process algebra for reasoning about quantum security
- Exogenous probabilistic computation tree logic
- Model-checking linear-time properties of quantum systems
- QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
- Temporalization of Probabilistic Propositional Logic
- Importing logics: soundness and completeness preservation
- Techniques for Formal Modelling and Analysis of Quantum Systems
- Classical logic and quantum logic with multiple and common lattice models
- Probabilistic logic over paths
- Toward automatic verification of quantum programs
- Importing logics
This page was built for publication: Weakly complete axiomatization of exogenous quantum propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495653)