Kai Wehmeier

It is well known that Frege's system in the Grundgesetze der Arithmetik is formally inconsistent. Frege's instantiation rule for the second-order universal quantifier makes his system, except for minor differences, full (i.e., with unrestricted comprehension) second-order logic, augmented by an abstraction operator that abides to Frege's basic law V. A few years ago, Richard Heck proved the consistency of the fragment of Frege's theory obtained by restricting the comprehension schema to predicative formulae. He further conjectured that the more encompassing Δ11-comprehension schema would already be inconsistent. In the present paper, we show that this is not the case.

It is a philosophical commonplace that quantification involves, invokes, or presupposes, the relation of identity. There seem to be two major sources for this belief: the conviction that identity is implicated in the phenomenon of bound variable recurrence within the scope of a quantifier; memories of Quine’s insistence that quantification requires absolute identity for the values of variables. With respect to, I show that the only extant argument for a dependence of variable recurrence on identity, due to John Hawthorne, fails. I further show that the function of variable recurrence is not subsumed under that of identity, so that a dependence of the former on the latter, if any, would have to be of a rather indirect nature. With respect to, I argue that the relevant passage in Quine fails to establish a connection between quantification and the identity relation, and indeed wasn’t intended by Quine to do so.

The aim of the present study is (1) to show, on the basis of a number of unpublished documents, how Heinrich Scholz supported his Warsaw colleague Jan ?ukasiewicz, the Polish logician, during World War II, and (2) to discuss the efforts he made in order to enable Jan ?ukasiewicz and his wife Regina to move from Warsaw to Münster under life-threatening circumstances. In the first section, we explain how Scholz provided financial help to ?ukasiewicz, and we also adduce evidence of the risks incurred by German scholars who offered assistance to their Polish colleagues. In the second section, we discuss the dramatic circumstances surrounding the ?ukasiewiczes' move to Münster in the summer of 1944

In the first part of this paper we investigate the intuitionistic version $iI\!\Sigma_1$ of $I\!\Sigma_1$ (in the language of $PRA$ ), using Kleene's recursive realizability techniques. Our treatment closely parallels the usual one for $HA$ and establishes a number of nice properties for $iI\!\Sigma_1$ , e.g. existence of primitive recursive choice functions (this is established by different means also in [D94]). We then sharpen an unpublished theorem of Visser's to the effect that quantifier alternation alone is much less powerful intuitionistically than classically: $iI\!\Sigma_1$ together with induction over arbitrary prenex formulas is $\Pi_2$ -conservative over $iI\!\Pi_2$ . In the second part of the article we study the relation of $iI\!\Sigma_1$ to $iI\!\Pi_1$ (in the usual arithmetical language). The situation here is markedly different from the classical case in that $iI\!\Pi_1$ and $iI\!\Sigma_1$ are mutually incomparable, while $iI\!\Sigma_1$ is significantly stronger than $iI\!\Pi_1$ as far as provably recursive functions are concerned: All primitive recursive functions can be proved total in $iI\!\Sigma_1$ whereas the provably recursive functions of $iI\!\Pi_1$ are all majorized by polynomials over ${\Bbb N}$ . 0 $iI\!\Pi_1$ is unusual also in that it lacks closure under Markov's Rule $\mbox{MR}_{PR}$

We investigate a variant of the variable convention proposed at Tractatus 5.53ff for the purpose of eliminating the identity sign from logical notation. The variant in question is what Hintikka has called the strongly exclusive interpretation of the variables, and turns out to be what Ramsey initially (and erroneously) took to be Wittgenstein's intended method. We provide a tableau calculus for this identity-free logic, together with soundness and completeness proofs, as well as a proof of mutual interpretability with first-order logic with identity.

In Section 10 of Grundgesetze, Volume I, Frege advances a mathematical argument (known as the permutation argument), by means of which he intends to show that an arbitrary value-range may be identified with the True, and any other one with the False, without contradicting any stipulations previously introduced (we shall call this claim the identifiability thesis, following Schroeder-Heister (1987)). As far as we are aware, there is no consensus in the literature as to (i) the proper interpretation of the permutation argument and the identifiability thesis, (ii) the validity of the permutation argument, and (iii) the truth of the identifiability thesis. In this paper, we undertake a detailed technical study of the two main lines of interpretation, and gather some evidence for favoring one interpretation over the other.