Journal of Philosophical Logic 26 (6):661-670 (1997)
|Abstract||In this paper I wish to show that we can give a statement of a restricted form of Gleason's Theorem that is classically equivalent to the standard formulation, but that avoids the counterexample that Hellman gives in "Gleason's Theorem is not Constructively Provable"|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Daniele Mundici (1994). A Constructive Proof of McNaughton's Theorem in Infinite-Valued Logic. Journal of Symbolic Logic 59 (2):596-602.
Timothy W. Gleason (1992). Book Review: Unreliable Sources: Review by Timothy W. Gleason. [REVIEW] Journal of Mass Media Ethics 7 (1):54 – 59.
Feng Ye (2000). Toward a Constructive Theory of Unbounded Linear Operators. Journal of Symbolic Logic 65 (1):357-370.
Bas Spitters (2006). A Constructive View on Ergodic Theorems. Journal of Symbolic Logic 71 (2):611 - 623.
Geoffrey Hellman (1993). Gleason's Theorem is Not Constructively Provable. Journal of Philosophical Logic 22 (2):193 - 203.
Itamar Pitowsky (2004). Generalizations of Kochen and Specker's Theorem and the Effectiveness of Gleason's Theorem. Studies in History and Philosophy of Science Part B 35 (2):177-194.
Ehud Hrushovski & Itamar Pitowsky (2004). Generalizations of Kochen and Specker's Theorem and the Effectiveness of Gleason's Theorem. Studies in History and Philosophy of Science Part B 35 (2):177-194.
Fred Richman (2000). Gleason's Theorem has a Constructive Proof. Journal of Philosophical Logic 29 (4):425-431.
Added to index2009-01-28
Total downloads11 ( #107,400 of 722,853 )
Recent downloads (6 months)1 ( #60,917 of 722,853 )
How can I increase my downloads?