Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Branching Space-Time, Modal Logic and the Counterfactual Conditional

Thomas Müller

Published Jan 1, 2002• 51 citations
Publisher
DOI
10.1007/978-94-010-0385-8_18

Related papers

Funny business in branching space-times: infinite modal correlations

Thomas Müller, Nuel Belnap, Kohei Kishida

Synthese•Aug 9, 2007•39 citations

Space-Time Counterfactuals

J. Finkelstein

arXiv:quant-ph/9811057•Synthese•Jun 1, 1999•12 citations

Strong versions of Bell’s theorem

Henry Pierce Stapp

Technical aspects of a recently constructed strong version of Bell's theorem are discussed. The theorem assumes neither hidden variables nor factorization, and neither determinism nor counterfactual definiteness. It deals directly with logical connections. Hence its relationship with modal logic needs to be described. It is shown that the proof can be embedded in an orthodox modal logic, and hence its compatibility with modal logic assured, but that this embedding weakens the theorem by introducing as added assumptions the conventionalities of the particular modal logic that is adopted. This weakening is avoided in the recent proof by using directly the set-theoretic conditions entailed by the locality assumption.

Physical Review A•May 1, 1994•10 citations

Branching space-time

Nuel Belnap

Synthese•Sep 1, 1992•226 citations

Nonlocality, Counterfactual, and Consistent Histories

Henry Pierce Stapp

The paper develops a version of modal logic that stays completely within the framework provided by quantum principles, and then proves, within the framework of quantum thinking, and in particular without invoking "hidden variables", a Bell-type nonlocality result.

arXiv:quant-ph/9905055•May 17, 1999•2 citations

Modern Space-Time and Undecidability

Rodolfo Gambini, Jorge A. Pullin

Springer eBooks•Nov 21, 2009•26 citations
Technical aspects of a recently constructed strong version of Bell's theorem are discussed. The theorem assumes neither hidden variables nor factorization, and neither determinism nor counterfactual definiteness. It deals directly with logical connections. Hence its relationship with modal logic needs to be described. It is shown that the proof can be embedded in an orthodox modal logic, and hence its compatibility with modal logic assured, but that this embedding weakens the theorem by introducing as added assumptions the conventionalities of the particular modal logic that is adopted. This weakening is avoided in the recent proof by using directly the set-theoretic conditions entailed by the locality assumption.