We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)

Many contributors of the debate about knowledge by testimony concentrate on the problem of justification. In my paper I will stress a different point – the concept of testimony itself. As a starting point I will use the definitional proposal of Jennifer Lackey. She holds that the concept of testimony should be regarded as entailing two aspects – one corresponding to the speaker, the other one to the hearer. I will adopt the assumption that we need to deal with both (...) aspects. Nevertheless, I will show that her concept – which suggests regarding testimony as an act of communication conveying information – is too broad and, therefore, I will end up with a different twofold definition. (shrink)

The purpose of this article is to explain why I believe that the Continuum Hypothesis (CH) is not a definite mathematical problem. My reason for that is that the concept of arbitrary set essential to its formulation is vague or underdetermined and there is no way to sharpen it without violating what it is supposed to be about. In addition, there is considerable circumstantial evidence to support the view that CH is not definite.

This paper builds on the system of David Lewis’s “Parts of Classes” to provide a foundation for mathematics that arguably requires not only no distinctively mathematical ideological commitments (in the sense of Quine), but also no distinctively mathematical ontological commitments. Provided only that there are enough individual atoms, the devices of plural quantification and mereology can be employed to simulate quantification over classes, while at the same time allowing all of the atoms (and most of their fusions with which we (...) are concerned) to be individuals (that is, urelements of classes). The final section of the paper canvasses some reasons to be committed to the required ontology for other than mathematical reasons. (shrink)

In this article, we discuss a simple argument that modal metaphysics is misconceived, and responses to it. Unlike Quine's, this argument begins with the simple observation that there are different candidate interpretations of the predicate ‘could have been the case’. This is analogous to the observation that there are different candidate interpretations of the predicate ‘is a member of’. The argument then infers that the search for metaphysical necessities is misguided in much the way the ‘set-theoretic pluralist’ claims that the (...) search for the true axioms of set theory is. We show that the obvious responses to this argument fail. However, a new response has emerged that purports to prove, from higher-order logical principles, that metaphysical possibility is the broadest kind of possibility applying to propositions, and is to that extent special. We distill two lines of reasoning from the literature, and argue that their import depends on premises that any ‘modal pluralist’ should deny. Both presuppose that there is a unique typed hierarchy, which is what the modal pluralist, in the context of higher-order logic, should disavow. In other words, both presupposes that there is a unique candidate for what higher-order claims could mean. We consider the worry that, in a higher-order setting, modal pluralism faces an insuperable problem of articulation, collapses into modal monism, is vulnerable to the Russell-Myhill paradox, or even contravenes the truism that there is a unique actual world, and argue that these worries are misplaced. We also sketch the bearing of the resulting ‘Higher-Order Pluralism’ on the theory of content. One theme of the discussion is that, if Higher-Order Pluralism is correct, then there is no fixed metatheory from which to characterize higher-order reality. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

We study the definability of ultrafilter bases on \ in the sense of descriptive set theory. As a main result we show that there is no coanalytic base for a Ramsey ultrafilter, while in L we can construct \ P-point and Q-point bases. We also show that the existence of a \ ultrafilter is equivalent to that of a \ ultrafilter base, for \. Moreover we introduce a Borel version of the classical ultrafilter number and make some observations.

The notion of strength has featured prominently in recent debates about abductivism in the epistemology of logic. Following Williamson and Russell, we distinguish between logical and scientific strength and discuss the limits of the characterizations they employ. We then suggest understanding logical strength in terms of interpretability strength and scientific strength as a special case of logical strength. We present applications of the resulting notions to comparisons between logics in the traditional sense and mathematical theories.

The book is devoted to the contemporary stage of quantum mechanics – quantum information, and especially to its philosophical interpretation and comprehension: the first one of a series monographs about the philosophy of quantum information. The second will consider Be l l ’ s inequalities, their modified variants and similar to them relations. The beginning of quantum information was in the thirties of the last century. Its speed development has started over the last two decades. The main phenomenon is entanglement. (...) The subareas are quantum computer, quantum communication (and teleportation), and quantum cryptography. The book offers the following main conceptions, theses and hypotheses: – dualistic Phythagoreanism as a new kind among the interpretations of quantum mechanics and information: arithmetical, logical, and metamathematical one; – Gödel ’ s first incompleteness theorem is an undecidable proposition, and consequently the second one,too. – a partial rehabilitation of Hilbert ’ s program for the self-foundation of mathematics; – the dual-foundation of mathematics; – Skolemian relativity between: Cantor ’s kinds of infinity, finiteness and infinity, discreteness and continuity, completeness and incompleteness, etc.; – information is a physical quantity representing the non-reducibility of a system to its parts, particularly nonaddtivity; – there exist pure relations «by itself», which cannot be reduced to predications; – energy conservation can and should be generalized; – Einstein’ s «general covariance» or «principle of relativity» can and should be generalized to cover discrete morphisms where the notion of velocity does not make sense. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

According to the iterative conception of set, each set is a collection of sets formed prior to it. The notion of priority here plays an essential role in explanations of why contradiction-inducing sets, such as the Russell set, do not exist. Consequently, these explanations are successful only to the extent that a satisfactory priority relation is made out. I argue that attempts to do this have fallen short: understanding priority in a straightforwardly constructivist sense threatens the coherence of the empty (...) set and raises serious epistemological concerns; but the leading realist interpretations---ontological and modal interpretations of priority---are deeply problematic as well. I conclude that the purported explanatory virtues of the iterative conception are, at present, unfounded. (shrink)

The principle of set theory known as the Axiom of Choice has been hailed as “probably the most interesting and, in spite of its late appearance, the most discussed axiom of mathematics, second only to Euclid's axiom of parallels which was introduced more than two thousand years ago” (Fraenkel, Bar-Hillel & Levy 1973, §II.4). The fulsomeness of this description might lead those unfamiliar with the axiom to expect it to be as startling as, say, the Principle of the Constancy of (...) the Velocity of Light or the Heisenberg Uncertainty Principle. But in fact the Axiom of Choice as it is usually stated appears humdrum, even self-evident. For it amounts to nothing more than the claim that, given any collection of mutually disjoint nonempty sets, it is possible to assemble a new set — a transversal or choice set — containing exactly one element from each member of the given collection. Nevertheless, this seemingly innocuous principle has far-reaching mathematical consequences — many indispensable, some startling — and has come to figure prominently in discussions on the foundations of mathematics. It (or its equivalents) have been employed in countless mathematical papers, and a number of monographs have been exclusively devoted to it. (shrink)

Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms — first-order logic, type theory, and set theory — are usually only adequate for reasoning about partial functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein practice. This paper shows how the traditional approach to partial functions (...) can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann—Bernays—Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems. (shrink)

This paper aims to outline an analysis and interpretation of the process that led to First-Order Logic and its consolidation as a core system of modern logic. We begin with an historical overview of landmarks along the road to modern logic, and proceed to a philosophical discussion casting doubt on the possibility of a purely rational justification of the actual delimitation of First-Order-Logic. On this basis, we advance the thesis that a certain historical tradition was essential to the emergence of (...) modern logic; this traditional context is analyzed as consisting in some guiding principles and, particularly, a set of exemplares (i.e., paradigmatic instances). Then, we proceed to interpret the historical course of development reviewed in section 1, which can broadly be described as a two-phased movement of expansion and then restriction of the scope of logical theory. We shall try to pinpoint ambivalencies in the process, and the main motives for subsequent changes. Among the latter, one may emphasize the spirit of modern axiomatics, the situation of foundational insecurity in the 1920s, the resulting desire to find systems well-behaved from a proof-theoretical point of view, and the metatheoretical results of the 1930s. Not surprisingly, the mathematical and, more specifically, the foundational context in which Firs-Order-Logic matured will be seen to have played a primary role in its shaping. (shrink)

The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The (...) relevant mathematical structure is Hilbert arithmetic in a wide sense, in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem. (shrink)

This book presents the classic relative consistency proofs in set theory that are obtained by the device of 'inner models'. Three examples of such models are investigated in Chapters VI, VII, and VIII; the most important of these, the class of constructible sets, leads to G6del's result that the axiom of choice and the continuum hypothesis are consistent with the rest of set theory [1]I. The text thus constitutes an introduction to the results of P. Cohen concerning the independence of (...) these axioms [2], and to many other relative consistency proofs obtained later by Cohen's methods. Chapters I and II introduce the axioms of set theory, and develop such parts of the theory as are indispensable for every relative consistency proof; the method of recursive definition on the ordinals being an import ant case in point. Although, more or less deliberately, no proofs have been omitted, the development here will be found to require of the reader a certain facility in naive set theory and in the axiomatic method, such e as should be achieved, for example, in first year graduate work. (shrink)

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...) implement the idea of "infinite calculation" is the main subject. (shrink)

It is argued that mathematical statements are "a posteriori synthetic" statements of a very special sort, To be called "structure-Analytic" statements. They follow logically from the axioms defining the mathematical structure they are describing--Provided that these axioms are "consistent". Yet, Consistency of these axioms is an empirical claim: it may be "empirically verifiable" by existence of a finite model, Or may have the nature of an "empirically falsifiable hypothesis" that no contradiction can be derived from the axioms.

We develop a framework for natural language semantics which handles intensionality via metalogical constructions and deals with degree truth values in an integrated way. We take an axiomatic set theory, ZF, as the foundation for semantic representations, but we make ZF a metalanguage for part of itself by embedding a language ℒ within ZF which is basically a copy of the part of ZF consisting of set expressions. This metalogical set-up is used for handling propositional attitude verbs (limited to believe (...) in this paper). We define a truth function τ which determines the truth value τ(p, T) of an ℒ-proposition p with respect to a theory T. Theories are sets of ℒ-propositions with associated truth values, and can be viewed as a (much more well-defined) replacement for possible worlds. We develop a mechanism for defining belief worlds as theories. We simultaneously develop two different versions of our system - a Boolean version where the set Ω of truth values is {0, 1}, and a degree-truth version where Ω is the interval [0, 1] of real numbers. We use degrees of truth in handling a broad class of semantic predicates that we call base-focus predicates, which include generalized quantifiers as well as many adverb and adjective senses and certain discourse-level predicates. (shrink)

Set theory is an autonomous and sophisticated field of mathematics, enormously successful not only at its continuing development of its historical heritage but also at analyzing mathematical propositions cast in set-theoretic terms and gauging their consistency strength. But set theory is also distinguished by having begun intertwined with pronounced metaphysical attitudes, and these have even been regarded as crucial by some of its great developers. This has encouraged the exaggeration of crises in foundations and of metaphysical doctrines in general. However, (...) set theory has proceeded in the opposite direction, from a web of intensions to a theory of extensionpar excellence, and like other fields of mathematics its vitality and progress have depended on a steadily growing core of mathematical structures and methods, problems and results. There is also the stronger contention that from the beginning set theory actually developed through a progression ofmathematicalmoves, whatever and sometimes in spite of what has been claimed on its behalf.What follows is an account of the development of set theory from its beginnings through the creation of forcing based on these contentions, with an avowedly Whiggish emphasis on the heritage that has been retained and developed by current set theory. The whole transfinite landscape can be viewed as the result of Cantor's attempt to articulate and solve the Continuum Problem. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Russell had two theories of definite descriptions: one for singular descriptions, another for plural descriptions. We chart its development, in which ‘On Denoting’ plays a part but not the part one might expect, before explaining why it eventually fails. We go on to consider many-valued functions, since they too bring in plural terms—terms such as ‘4’ or the descriptive ‘the inhabitants of London’ which, like plain plural descriptions, stand for more than one thing. Logicians need to take plural reference seriously (...) if only because mathematicians take many-valued functions seriously. We assess the objection (by Russell, Frege and others) that many-valued functions are illegitimate because the corresponding terms are ambiguous. We also assess the various methods proposed for getting rid of them. Finding the objection ill-founded and the methods ineffective, we introduce a logical framework that admits plural reference, and use it to answer some earlier questions and to raise some more. (shrink)

Three disciplines address the codified forms and rules of human thought and reasoning: logic, available since antiquity; dialectics as a process of logical reasoning; and semiotics which focuses on the epistemological properties of the extant domain. However, both the paradigmatic-historical model of knowledge and the logical-semiotic model of thought tend to incorrectly emphasize the separation and differences between the respective domains vs. their overlap and interactions. We propose a sublation of linguistic logics of objects and static forms by a dynamic (...) logic of real physical-mental processes designated as the Logic in Reality (LIR). In our generalized logical theory, dialectics and semiotics are recovered from reductionist interpretations and reunited in a new synthetic paradigm centered on meaning and its communication. Our theory constitutes a meta-thesis composed of elements from science, logic and philosophy. We apply the theory to gain new insights into the structure and role of semiosis, information and communication and propose the concept of ‘ontolon’ to define the element of reasoning as a real dynamic process. It is part of a project within natural philosophy, which will address broader aspects of the dynamics of the growth of civilizations and their potential implications for the information society. (shrink)

Since Turing proposed the first test of intelligence, several modifications have been proposed with the aim of making Turing’s proposal more realistic and applicable in the search for artificial intelligence. In the modern context, it turns out that some of these definitions of intelligence and the corresponding tests merely measure computational power. Furthermore, in the framework of the original Turing test, for a system to prove itself to be intelligent, a certain amount of deceit is implicitly required which can have (...) serious security implications for future human societies. In this article, we propose a unified framework for developing intelligence tests which takes care of important ethical and practical issues. Our proposed framework has several important consequences. Firstly, it results in the suggestion that it is not possible to construct a single, context independent, intelligence test. Secondly, any measure of intelligence must have access to the process by which a problem is solved by the system under consideration and not merely the final solution. Finally, it requires an intelligent agent to be evolutionary in nature with the flexibility to explore new algorithms on its own. (shrink)

It is proved that in the absence of proper class inner models with Woodin cardinals, for each n ε {1,…,ω}, ∑3 + n1 absoluteness implies there are n strong cardinals in K (where this denotes a suitably defined global version of the core model for one Woodin cardinal as exposed by Steel. Combined with a forcing argument of Woodin, this establishes that the consistency strength of ∑3 + n1 absoluteness is exactly that of n strong cardinals so that in particular (...) projective absoluteness is equiconsistent with the existence of infinitely many strong cardinals. It is also argued how this theorem is to be construed as the first step in the long range program of showing that projective determinacy is equivalent to its analytical consequences for the projective sets which would settle positively a conjecture of Woodin and thereby solve the last Delfino problem. (shrink)

This article is an attempt to present Gödel's discussion on concepts, from 1944 to the late 1970s, in particular relation to the thought of Frege and Russell. The discussion takes its point of departure from Gödel's claim in notes on Bernay's review of ?Russell's mathematical logic?. It then retraces the historical background of the notion of intension which both Russell and Gödel use, and offers some grounds for claiming that Gödel consistently considered logic as a free-type theory of concepts, called (...) intensions, considered as the denotations of predicate names. (shrink)

This paper discusses the principle of recombination for possible worlds. It argues that arguments against unrestricted recombination offered by Forrest and Armstrong and by David Lewis fail, but a related argument is a challenge, and recommends that we accept an unrestricted principle of recombination and the conclusion that possible worlds form a proper class.

Structural Realism (SSR), as embodied in the Ramsey-sentence H* of a theory H, is defended against the view that H* reduces to a trivial statement about the cardinality of the domain of H, a view which arises from ignoring the central role of observation within science. Putnam’s theses are examined and shown to support rather than undermine SSR. Finally: in view of its synthetic character, applied mathematics must enter into the formulation of H* and hence be shown to be finitely (...) axiomatisable; this is done in the Appendix, which is the most important part of the paper. (shrink)

In this paper we argue that Revision Rules, introduced by Anil Gupta and Nuel Belnap as a tool for the analysis of the concept of truth, also provide a useful tool for defining computable functions. This also makes good on Gupta's and Belnap's claim that Revision Rules provide a general theory of definition, a claim for which they supply only the example of truth. In particular we show how Revision Rules arise naturally from relaxing and generalizing a classical construction due (...) to Kleene, and indicate how they can be employed to reconstruct the class of the general recursive functions. We also point at how Revision Rules can be employed to access non-minimal fixed points of partially defined computing procedures. (shrink)

Azriel Levy did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcing and definability will continue to be basic to the subject. What follows is a detailed account and analysis of Levy’s work and contributions (...) to set theory. (shrink)