Journal of Philosophical Logic 39 (4) (2010)
|Abstract||Branching space-times (BST; Belnap, Synthese 92:385–434, 1992 ) is the most advanced formal framework for representing indeterminism. BST is however based on continuous partial orderings, while our natural way of describing indeterministic scenarios may be called discrete. This paper establishes a theorem providing a discrete data format for BST: it is proved that a discrete representation of indeterministic scenarios leading to BST models is possible in an important subclass of cases. This result enables the representation of limited indeterminism in BST and hopefully paves the way for the representation of substances with capacities in that framework|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
T. Kowalski & Tomasz Placek (1999). Outcomes in Branching Space-Time and GHZ-Bell Theorems. British Journal for the Philosophy of Science 50 (3):349-375.
Nuel Belnap (2008). Funny Business in Branching Space-Times: Infinite Modal Correlations. Synthese 164 (1):141 - 159.
Thomas Müller, Nuel Belnap & Kohei Kishida (2008). Funny Business in Branching Space-Times: Infinite Modal Correlations. Synthese 164 (1):141 - 159.
Tomasz Placek (2012). On Individuals in Branching Histories. Synthese 188 (1):23-39.
Thomas Muller (2007). A Branching Space-Times View on Quantum Error Correction. Studies in History and Philosophy of Science Part B 38 (3):635-652.
T. Placek (2012). Indeterminism is a Modal Notion: Branching Spacetimes and Earman's Pruning. Synthese 187 (2):441-469.
Added to index2010-06-30
Total downloads25 ( #49,599 of 549,088 )
Recent downloads (6 months)1 ( #63,317 of 549,088 )
How can I increase my downloads?