A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included.

The idea of a 'logic of quantum mechanics' or quantum logic was originally suggested by Birkhoff and von Neumann in their pioneering paper [1936]. Since that time there has been much argument about whether, or in what sense, quantum 'logic' can be actually considered a true logic (see, e.g. Bell and Hallett [1982], Dummett [1976], Gardner [1971]) and, if so, how it is to be distinguished from classical logic. In this paper I put forward a simple and natural semantical (...) framework for quantum logic which reveals its difference from classical logic in a strikingly intuitive way, viz. through the fact that quantum logic admits (suitably formulated versions of) the characteristic quantum-mechanical notions of superposition and incompatibility of attributes. That is, precisely the features that distinguish quantum from classical physics also serve, within this framework, to distinguish quantum from classical logic. Some light is shed on the question of whether quantum logic is a genuine logical system by introducing a natural entailment relation for quantum-logical formulas with the implication symbol. The novelty is that, although implication behaves as it should (i.e. the 'deduction theorem' holds), the order of introduction of premises is significant. The fact that a reasonable entailment relation can be formulated for quantum logic supports the view that it is a genuine logical system and not merely an algebraic formalism. (shrink)

In this paper (a sequel to [4]) I put forward a "local" interpretation of mathematical concepts based on notions derived from category theory. The fundamental idea is to abandon the unique absolute universe of sets central to the orthodox set-theoretic account of the foundations of mathematics, replacing it by a plurality of local mathematical frameworks - elementary toposes - defined in category-theoretic terms.

This paper is an introduction to topos theory which assumes no prior knowledge of category theory. It includes a discussion of internal logic in a topos, A characterization of the category of sets, And an investigation of the notions of topology and sheaf in a topos.

A key idea in both Frege's development of arithmetic in theGrundlagen[7] and Zermelo's 1904 proof [10] of the well-ordering theorem is that of a “type reducing” correspondence between second-level and first-level entities. In Frege's construction, the correspondence obtains betweenconceptandnumber, in Zermelo's (through the axiom of choice), betweensetandmember. In this paper, a formulation is given and a detailed investigation undertaken of a system ℱ of many-sorted first-order logic (first outlined in the Appendix to [6]) in which this notion of type reducing (...) correspondence is accorded a central role and which enables Frege's and Zermelo's constructions to be presented in such a way as to reveal their essential similarity. By adapting Bourbaki's version of Zermelo's proof of the well-ordering theorem, we show that, within ℱ, any correspondencecbetween second-level entities (here calledconcepts) and first-level ones (here calledobjects) induces a well-ordering relationW(c) in a canonical manner. We shall see that, whencis the “Fregean” correspondence between concepts and cardinal numbers,W(c) is (the well-ordering of) the ordinalω+ 1, and whencis a “Zermelian” choice function on concepts,W(c) is a well-ordering of the universal concept embracing all objects.In ℱ an important role is played by the notion ofextensionof a concept. To each conceptXwe assume there is assigned an objecte(X) in such a way that, for any conceptsX, Ysatisfying a certain predicateE, we havee(X) =e(Y) iff the same objects fall underXandY. (shrink)

We analyze Zorn's Lemma and some of its consequences for Boolean algebras in a constructive setting. We show that Zorn's Lemma is persistent in the sense that, if it holds in the underlying set theory, in a properly stated form it continues to hold in all intuitionistic type theories of a certain natural kind. (Observe that the axiom of choice cannot be persistent in this sense since it implies the law of excluded middle.) We also establish the persistence of some (...) familiar results in the theory of (complete) Boolean algebras--notably, the proposition that every complete Boolean algebra is an absolute subretract. This (almost) resolves a question of Banaschewski and Bhutani as to whether the Sikorski extension theorem for Boolean algebras is persistent. (shrink)

The infinitesimal methods commonly used in the 17th and 18th centuries to solve analytical problems had a great deal of elegance and intuitive appeal. But the notion of infinitesimal itself was flawed by contradictions. These arose as a result of attempting to representchange in terms ofstatic conceptions. Now, one may regard infinitesimals as the residual traces of change after the process of change has been terminated. The difficulty was that these residual traces could not logically coexist with the static quantities (...) traditionally employed by mathematics. The solution to this difficulty, as it turns out, is to regard these quantities asalso being subject to (a form of) change, for then they will have the same nature as the infinitesimals representing the residual traces of change, and will become,ipso facto, compatible with these latter.In fact, the category-theoretic models which realize the Principle of Infinitesimal Linearity may themselves be regarded as representations of a general concept of variation (cf. Bell (1986)). While the static set-theoretical models represent change or motion by making a detour through the actual (but static) infinite, the varying category-theoretic models enable such change to be representeddirectly, thus permitting the introduction of geometric infinitesimals and, as we have attempted to demonstrate in this paper, the virtually complete incorporation of the methods of the early calculus.It is surely a remarkable — even an ironic — fact that the contradiction between the flux of the objective world and the stasis of mathematical entities has found its resolution in category theory, a branch of mathematics commonly, and, as one now sees, mistakenly, regarded as the summit of gratuitous abstraction. (shrink)

We analyze Zorn's Lemma and some of its consequences for Boolean algebras in a constructive setting. We show that Zorn's Lemma is persistent in the sense that, if it holds in the underlying set theory, in a properly stated form it continues to hold in all intuitionistic type theories of a certain natural kind. We also establish the persistence of some familiar results in the theory of Boolean algebras--notably, the proposition that every complete Boolean algebra is an absolute subretract. This (...) resolves a question of Banaschewski and Bhutani as to whether the Sikorski extension theorem for Boolean algebras is persistent. (shrink)

Consider the following well-known result from the theory of normed linear spaces ([2], p. 80, 4(b)): (g) the unit ball of the (continuous) dual of a normed linear space over the reals has an extreme point. The standard proof of (~) uses the axiom of choice (AG); thus the implication AC~(w) can be proved in set theory. In this paper we show that this implication can be reversed, so that (*) is actually eq7I2valent to the axiom of choice. From this (...) we derive various corollaries, for example: the conjunction of the Boolean prime ideal theorem and the Krein-Milman theorem implies the axiom of choice, and the Krein-Milman theorem is not derivable from the Boolean prime ideal theorem. (shrink)

Continuous as the stars that shine And twinkle on the milky way, They stretched in never-ending line Along the margin of a bay: Ten thousand saw I at a glance, Tossing their heads in sprightly dance.

In this paper we construct the ortholattices arising in quantum logic starting from the phenomenologically plausible idea of a collection of ensembles subject to passing or failing various “tests.” A collection of ensembles forms a certain kind of preordered set with extra structure called anorthospace; we show that complete ortholattices arise as canonical completions of orthospaces in much the same way as arbitrary complete lattices arise as canonical completions of partially ordered sets. We also show that the canonical completion of (...) an orthospace of ensembles is naturally identifiable as the complete lattice of properties of the ensembles, thereby revealing exactlywhy ortholattices arise in the analysis of “tests” or experimental propositions. Finally, we axiomatize the hitherto implicit concept of “test” and show how they may be correlated with properties of ensembles. (shrink)