According to the indispensability argument, the fact that we quantify over numbers, sets and functions in our best scientific theories gives us reason for believing that such objects exist. I examine a strategy to dispense with such quantification by simply replacing any given platonistic theory by the set of sentences in the nominalist vocabulary it logically entails. I argue that, as a strategy, this response fails: for there is no guarantee that the nominalist world that go beyond the set of (...) sentences in the nominalist language such theories entail. However, I argue that what such theories show is that mathematics can enable us to express possibilities about the concrete world that may not be expressible in nominalistically acceptable language. While I grant that this may make quantification over abstracta indispensable, I deny that such indispensability is a reason for accepting them into our ontology. I urge that the nominalist should be allowed to quantify over abstracta whilst denying their existence and I explain how this apparently contradictory practice (a practice I call 'weaseling') is in fact coherent, unproblematic and rational. Finally, I examine the view that platonistic theories are simpler or more attractive than their nominalistic reformulations, and thus that abstract ought to be accepted into our ontology for the same sorts of reasons as other theoretical objects. I argue that, at least in the case of numbers, functions and sets, such arguments misunderstand the kind of simplicity and attractiveness we seek. (shrink)

This paper puts forward and defends an account of mathematical truth, and in particular an account of the truth of mathematical axioms. The proposal attempts to be completely nonrevisionist. In this connection, it seeks to satisfy simultaneously both horns of Benacerrafs work on informal rigour. Kreisel defends the view that axioms are arrived at by a rigorous examination of our informal notions, as opposed to being stipulated or arrived at by trial and error. This view is then supplemented by a (...) Fregean account of the objectivity and our knowledge of abstract objects. It is then argued that the resulting view faces no insurmountable metaphysical or epistemic obstacles. (shrink)

Cooper storage is a widespread technique for associating sentences with their meanings, used in diverse linguistic and computational linguistic traditions. This paper encodes the data structures and operations of cooper storage in the simply typed linear \-calculus, revealing the rich categorical structure of a graded applicative functor. In the case of finite cooper storage, which corresponds to ideas in current transformational approaches to syntax, the semantic interpretation function can be given as a linear homomorphism acting on a regular set of (...) trees, and thus generation can be done in polynomial time. (shrink)

We show in this paper that all fragments of intuitionistic propostional logic based on a subset of the connectives $\wedge, \vee, \rightarrow, \neg$ satisfy interpolation. Fragments containing $\leftrightarrow$ or $\neg\neg$ are briefly considered.

We are concerned here with recursive function theory analogs of certain problems in chromatic graph theory. The motivating question for our work is: Does there exist a recursive (countably infinite) planar graph with no recursive 4-coloring? We obtain the following results: There is a 3-colorable, recursive planar graph which, for all k, has no recursive k-coloring; every decidable graph of genus p ≥ 0 has a recursive 2(χ(p) - 1)-coloring, where χ(p) is the least number of colors which will suffice (...) to color any graph of genus p; for every k ≥ 3 there is a k-colorable, decidable graph with no recursive k-coloring, and if k = 3 or if k = 4 and the 4-color conjecture fails the graph is planar; there are degree preserving correspondences between k-colorings of graphs and paths through special types of trees which yield information about the degrees of unsolvability of k-colorings of graphs. (shrink)

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing with (...) the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to gain information about the category of compact Hausdorff spaces. (shrink)