Gleason's theorem is not constructively provable
From MaRDI portal
Publication:2366249
DOI10.1007/BF01049261zbMath0785.03041MaRDI QIDQ2366249
Publication date: 29 June 1993
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
halting problem; hidden variables; closed subspaces of a Hilbert space; generalized probability measures; quantum mechanical pure and mixed states
03F60: Constructive and recursive analysis
46N50: Applications of functional analysis in quantum physics
81P10: Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects)
46S30: Constructive functional analysis
Related Items
1995 Annual Meeting of the Association for Symbol Logic, Toward a constructive theory of unbounded linear operators, Pluralism in mathematics, Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem, A constructive proof of Gleason's theorem, A constructive formulation of Gleason's theorem, Gleason's theorem has a constructive proof, Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem, Can constructive mathematics be applied in physics?, Constructive mathematics and unbounded operators -- a reply to Hellman
Cites Work
