Online research in philosophy

A feature of David Lewis's account of conventions in his book "Convention" which has received admiring notices from philosophers is his use of the mathematical theory of games. In this paper I point out a number of serious flaws in Lewis's use of game theory. Lewis's basic claim is that conventions cover 'coordination problems'. I show that game-Theoretical analysis tends to establish that coordination problems in Lewis's sense need not underlie conventions.

Roughly speaking, classical statistical physics is the branch of theoretical physics that aims to account for the thermal behaviour of macroscopic bodies in terms of a classical mechanical model of their microscopic constituents, with the help of probabilistic assumptions. In the last century and a half, a fair number of approaches have been developed to meet this aim. This study of their foundations assesses their coherence and analyzes the motivations for their basic assumptions, and the interpretations of their central concepts. The most outstanding foundational problems are the explanation of time-asymmetry in thermal behaviour, the relative autonomy of thermal phenomena from their microscopic underpinning, and the meaning of probability. A more or less historic survey is given of the work of Maxwell, Boltzmann and Gibbs in statistical physics, and the problems and objections to which their work gave rise. Next, we review some modern approaches to (i) equilibrium statistical mechanics, such as ergodic theory and the theory of the thermodynamic limit; and to (ii) non-equilibrium statistical mechanics as provided by Lanford's work on the Boltzmann equation, the so-called Bogolyubov-Born-Green-Kirkwood-Yvon approach, and stochastic approaches such as `coarse-graining' and the `open systems' approach. In all cases, we focus on the subtle interplay between probabilistic assumptions, dynamical assumptions, initial conditions and other ingredients used in these approaches.

Recently, Brukner and Zeilinger have presented a number of arguments suggesting that the Shannon information is not well defined as a measure of information in quantum mechanics. If established, this result would be highly significant, as the Shannon information is fundamental to the way we think about information not only in classical but also in quantum information theory. On consideration, however, these arguments are found unsuccessful; I go on to suggest how they might be arising as a consequence of Zeilinger's proposed foundational principle for quantum mechanics.

Recently, Brukner and Zeilinger have presented a number of arguments suggesting that the Shannon information is not well defined as a measure of information in quantum mechanics. If established, this result would be highly significant, as the Shannon information is fundamental to the way we think about information not only in classical but also in quantum information theory. On consideration, however, these arguments are found unsuccessful; I go on to suggest how they might be arising as a consequence of Zeilinger`s proposed foundational principle for quantum mechanics.

This paper reports recent progress in applying nonstandard analysis to additive number theory, especially to problems involving upper Banach density.

The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundational point of view. We identify the following form of integration problems: an informal (mathematical; i.e, logically underspecified) specification has multiple concrete formal implementations between which queries and results have to be transported. The integration challenge consists in dealing with the implementation-specific details such as additional constants and properties. We pinpoint their role in safe and unsafe integration schemes and propose a proof-theoretic solution based on modular theory-graphs that include the meta-logical foundations. This also gives a clean conceptual basis for earlier attempts that explain integration via “content/semantic markup”.

The aim of this paper is to put into context the historical, foundational and philosophical significance of category theory. We use our historical investigation to inform the various category-theoretic foundational debates and to point to some common elements found among those who advocate adopting a foundational stance. We then use these elements to argue for the philosophical position that category theory provides a framework for an algebraic in re interpretation of mathematical structuralism. In each context, what we aim to show is that, whatever the significance of category theory, it need not rely upon any set-theoretic underpinning.

The goals of reduction andreductionism in the natural sciences are mainly explanatoryin character, while those inmathematics are primarily foundational.In contrast to global reductionistprograms which aim to reduce all ofmathematics to one supposedly ``universal'' system or foundational scheme, reductive proof theory pursues local reductions of one formal system to another which is more justified in some sense. In this direction, two specific rationales have been proposed as aims for reductive proof theory, the constructive consistency-proof rationale and the foundational reduction rationale. However, recent advances in proof theory force one to consider the viability of these rationales. Despite the genuine problems of foundational significance raised by that work, the paper concludes with a defense of reductive proof theory at a minimum as one of the principal means to lay out what rests on what in mathematics. In an extensive appendix to the paper,various reduction relations betweensystems are explained and compared, and arguments against proof-theoretic reduction as a ``good'' reducibilityrelation are taken up and rebutted.