Online research in philosophy

Recent work has defended “Euclidean” theories of set size, in which Cantor’s Principle (two sets have equally many elements if and only if there is a one-to-one correspondence between them) is abandoned in favor of the Part-Whole Principle (if A is a proper subset of B then A is smaller than B). It has also been suggested that Gödel’s argument for the unique correctness of Cantor’s Principle is inadequate. Here we see from simple examples, not that Euclidean theories of set (...) size are wrong, but that they must be either very weak and narrow or largely arbitrary and misleading. (shrink)

We examine a case in which non-computable behavior in a model is revealed by computer simulation. This is possible due to differing notions of computability for sets in a continuous space. The argument originally given for the validity of the simulation involves a simpler simulation of the simulation , still further simulations thereof, and a universality conjecture. There are difficulties with that argument, but there are other, heuristic arguments supporting the qualitative results. It is urged, using this example, that absolute (...) validation, while highly desirable, is overvalued. Simulations also provide valuable insights that we cannot yet (if ever) prove. (shrink)

We consider an approach to some philosophical problems that I call the Method of Conceptual Articulation: to recognize that a question may lack any determinate answer, and to re-engineer concepts so that the question acquires a definite answer in such a way as to serve the epistemic motivations behind the question. As a case study we examine “Galileo’s Paradox”, that the perfect square numbers seem to be at once as numerous as the whole numbers, by one-to-one correspondence, and yet less (...) numerous, being a proper subset. I argue that Cantor resolved this paradox by a method at least close to that proposed—not by discovering the true nature of cardinal number, but by articulating several useful and appealing extensions of number to the infinite. Galileo was right to suggest that the concept of relative size did not apply to the infinite, for the concept he possessed did not. Nor was Bolzano simply wrong to reject Hume’s Principle (that one-to-one correspondence implies equal number) in the infinitary case, in favor of Euclid’s Common Notion 5 (that the whole is greater than the part), for the concept of cardinal number (in the sense of “number of elements”) was not clearly defined for infinite collections. Order extension theorems now suggest that a theory of cardinality upholding Euclid’s principle instead of Hume’s is possible. Cantor’s refinements of number are not the only ones possible, and they appear to have been shaped by motivations and fruitfulness, for they evolved in discernible stages correlated with emerging applications and results. Galileo, Bolzano, and Cantor shared interests in the particulate analysis of the continuum and in physical applications. Cantor’s concepts proved fruitful for those pursuits. Finally, Gödel was mistaken to claim that Cantor’s concept of cardinality is forced on us; though Gödel gives an intuitively compelling argument, he ignores the fact that Euclid’s Common Notion is also intuitively compelling, and we are therefore forced to make a choice. The success of Cantor’s concept of cardinality lies not in its truth (for concepts are not true or false), nor its uniqueness (for it is not the only extension of number possible), but in its intuitive appeal, and most of all, its usefulness to the understanding. (shrink)

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)

Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer (...) and Ott's (1996) claim of uncomputable behavior in a system with riddled basins of attraction. Furthermore, it clarifies speculations that the stability of the solar system (and similar systems) may be undecidable, for the invariant tori established by KAM theory form sets that are not d-. (shrink)