Switch to: References

Add citations

You must login to add citations.
  1. Randomness? What Randomness?Klaas Landsman - 2020 - Foundations of Physics 50 (2):61-104.
    This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and compressibility. Following a philosophical discussion of randomness in general, I argue that deterministic interpretations of quantum mechanics are strictly speaking incompatible with the Born rule. I also stress the role of outliers, i.e. measurement outcomes that are not 1-random. Although these occur with low probability, their very existence implies that the no-signaling (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.
    Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The logic of Brouwer and Heyting.Joan Rand Moschovakis - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 77-125.
    Download  
     
    Export citation  
     
    Bookmark  
  • Analyzing realizability by Troelstra's methods.Joan Rand Moschovakis - 2002 - Annals of Pure and Applied Logic 114 (1-3):203-225.
    Realizabilities are powerful tools for establishing consistency and independence results for theories based on intuitionistic logic. Troelstra discovered principles ECT 0 and GC 1 which precisely characterize formal number and function realizability for intuitionistic arithmetic and analysis, respectively. Building on Troelstra's results and using his methods, we introduce the notions of Church domain and domain of continuity in order to demonstrate the optimality of “almost negativity” in ECT 0 and GC 1 ; strengthen “double negation shift” DNS 0 to DNS (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation