Notions of Completeness in the EPR Discussion

被引:0
|
作者
Krizek, Gerd Christian [1 ]
Mairhofer, Lukas [1 ]
机构
[1] Univ Appl Sci Tech Wien, Dept Appl Math & Phys, A-1200 Vienna, Austria
关键词
quantum mechanics; interpretation; EPR; Einstein-Podolsky-Rosen; entanglement; SCIENTIFIC THEORIES; EINSTEIN;
D O I
10.3390/e25040585
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We explore the different notions of completeness applied in the EPR discussion following and amending the thorough analysis of Arthur Fine. To this aim, we propose a classification scheme for scientific theories that provides a methodology for analyzing the different levels at which interpretive approaches come into play. This allows us to contrast several concepts of completeness that operate on specific levels of the theory. We introduce the notion of theory completeness and compare it with the established notions of Born completeness, Schrodinger completeness and bijective completeness. We relate these notions to the recent concept of ?-completeness and predictable completeness. The paper shows that the EPR argument contains conflicting versions of completeness. The confusion of these notions led to misunderstandings in the EPR debate and hindered its progress. Their clarification will thus contribute to recent debates on interpretational issues of quantum mechanics. Finally, we discuss the connection between the EPR paper and the Einstein-Rosen paper with regard to the question of completeness.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] A comparison of weak completeness notions
    AmbosSpies, K
    Mayordomo, E
    Zheng, XZ
    [J]. ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1996, : 171 - 178
  • [2] Weak Completeness Notions for Exponential Time
    Ambos-Spies, Klaus
    Bakibayev, Timur
    [J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (06) : 1388 - 1412
  • [3] Husserl's two notions of completeness
    Da Silva, JJ
    [J]. SYNTHESE, 2000, 125 (03) : 417 - 438
  • [4] Separation of NP-completeness notions
    Pavan, A
    Selman, AL
    [J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (03) : 906 - 918
  • [5] Separation of NP-completeness notions
    Pavan, A
    Selman, AL
    [J]. 16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 78 - 89
  • [6] 2 NOTIONS OF COMPLETENESS IN SEMIPRIME RINGS
    BURGESS, WD
    RAPHAEL, R
    [J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1976, 283 (13): : 927 - 929
  • [7] Husserl's Two Notions Of Completeness
    Jairo josé Da Silva
    [J]. Synthese, 2000, 125 : 417 - 438
  • [8] Weak Completeness Notions for Exponential Time
    Klaus Ambos-Spies
    Timur Bakibayev
    [J]. Theory of Computing Systems, 2019, 63 : 1388 - 1412
  • [9] Weak Completeness Notions for Exponential Time
    Ambos-Spies, Klaus
    Bakibayev, Timur
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 503 - 514
  • [10] A COMPARISON OF POLYNOMIAL-TIME COMPLETENESS NOTIONS
    WATANABE, O
    [J]. THEORETICAL COMPUTER SCIENCE, 1987, 54 (2-3) : 249 - 265