Gleason's theorem is not constructively provable

DOI10.1007/BF01049261zbMath0785.03041MaRDI QIDQ2366249

Geoffrey Hellman

Publication date: 29 June 1993

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

halting problemhidden variablesclosed subspaces of a Hilbert spacegeneralized probability measuresquantum mechanical pure and mixed states

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Applications of functional analysis in quantum physics (46N50) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Constructive functional analysis (46S30)

Related Items

Pluralism in mathematics ⋮ Constructive mathematics and unbounded operators -- a reply to Hellman ⋮ A constructive formulation of Gleason's theorem ⋮ 1995 Annual Meeting of the Association for Symbol Logic ⋮ Indeterminism in physics and intuitionistic mathematics ⋮ Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem ⋮ Toward a constructive theory of unbounded linear operators ⋮ Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem ⋮ Can constructive mathematics be applied in physics? ⋮ A constructive proof of Gleason's theorem ⋮ Gleason's theorem has a constructive proof

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gleason's theorem is not constructively provable