Logical Inconsistencies in Proofs of the Theorem of Bell
classification
🪐 quant-ph
keywords
proofshiddenlogicalpotentialbellbell-typeclasscontain
read the original abstract
We discuss a class of proofs of Bell-type inequalities that are based on tables of potential outcomes. These proofs state in essence: if one can only imagine (or write down in a table) the potential outcome of a hidden parameter model for EPR experiments then a contradiction to experiment and quantum mechanics follows. We show that these proofs do not contain hidden variables that relate to time or, if they do, lead to logical contradictions that render them invalid.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.