Identity, we're told, is the binary relation that every object bears to itself, and to itself only. But how can a relation be binary if it never relates two objects? This puzzled Russell and led Wittgenstein to declare that identity is not a relation between objects. The now standard view is that Wittgenstein's position is untenable, and that worries regarding the relational status of identity are the result of confusion. I argue that the rejection of identity as a binary relation (...) is perfectly tenable. To this end, I outline and defend a logical framework that is not committed to an objectual identity relation but is nevertheless expressively equivalent to first-order logic with identity. After it has thus been shown that there is no indispensability argument for objectual identity, I argue that we have good reasons for doubting the existence of such a relation, and rebut a number of attempts at discrediting these reasons. (shrink)
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 Δ₁¹-comprehension (...) schema would already be inconsistent. In the present paper, we show that this is not the case. (shrink)
We show that the actuality operator A is redundant in any propositional modal logic characterized by a class of Kripke models (respectively, neighborhood models). Specifically, we prove that for every formula ${\phi}$ in the propositional modal language with A, there is a formula ${\psi}$ not containing A such that ${\phi}$ and ${\psi}$ are materially equivalent at the actual world in every Kripke model (respectively, neighborhood model). Inspection of the proofs leads to corresponding proof-theoretic results concerning the eliminability of the actuality (...) operator in the actuality extension of any normal propositional modal logic and of any “classical” modal logic. As an application, we provide an alternative proof of a result of Williamson’s to the effect that the compound operator A□ behaves, in any normal logic between T and S5, like the simple necessity operator □ in S5. (shrink)
The purpose of the present paper is to challenge some received assumptions about the logical analysis of modal English, and to show that these assumptions are crucial to certain debates in current philosophy of language. Specifically, I will argue that the standard analysis in terms of quantified modal logic mistakenly fudges important grammatical distinctions, and that the validity of Kripke's modal argument against description theories of proper names crucially depends on ensuing equivocations.
In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and T (...) prove the existence of infinitely many non-logical objects (T deriving,moreover, the nonexistence of the value-range concept). Some implications concerning the interpretation of Frege's proof of referentiality and the possibility of classifying any of these subsystems as logicist are discussed. Finally, I explore the relation of T toCantor's theorem which is somewhat surprising. (shrink)
Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and used to bestow the full expressive power of (...) first-order logic with identity on W-logic in the presence of constants. (shrink)
We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.
The main goal of this paper is to present and compare two approaches to formalizing cross-world comparisons like John might have been taller than he is in quantified modal logics. One is the standard method employing degrees and graded positives, according to which the example just given is to be paraphrased as something like The height that John has is such that he might have had a height greater than it, which is amenable to familiar formalization strategies with respect to (...) quantified modal logic. The other approach, based on subjunctive modal logic, mimics the mixed indicative-subjunctive patterns typical of cross-world comparisons in many natural languages by means of explicit mood markers. This latter approach is new and should, for various reasons, appeal to linguists and philosophers. Along the way, I argue that attempts to capture cross-world comparison by means of sentential operators are either inadequate or subject to substantive logical and philosophical objections. (shrink)
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 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 Δ₁¹-comprehension schema would already be (...) inconsistent. In the present paper, we show that this is not the case. (shrink)
It is not quite as easy to see that there is in fact no formula of this modal language having the same truth conditions (in terms of S5 Kripke semantics) as (1). This was rst conjectured by Allen Hazen2 and later proved by Harold Hodes3. We present a simple direct proof of this result and discuss some consequences for the logical analysis of ordinary modal discourse.
We investigate and compare two major approaches to enhancing the expressive capacities of modal languages, namely the addition of subjunctive markers on the one hand, and the addition of scope-bearing actuality operators, on the other. It turns out that the subjunctive marker approach is not only every bit as versatile as the actuality operator approach, but that it in fact outperforms its rival in the context of cross-world predication.
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}$. (shrink)
ABSTRACT In this paper, I ask whether quantifiers are intensional operators, with variable assignments playing the role of indices. Certain formulations of extensional type theory suggest an affirmative answer, but the most satisfactory among them suffer from a contamination of their semantic ontology with syntactic material. I lay out ‘Fregean’ versions of extensional type theory that are free from syntactic contamination and suggest a negative answer to our question.
§1. Introduction. By means of what semantic features is a proper name tied to its bearer? This is a puzzling question indeed: proper names — like “Aristotle” or “Paris” — are syntactically simple, and it therefore does not seem possible to reduce their meanings, by means of a principle of compositionality, to the meanings of more basic, and hence perhaps more tractable, linguistic elements.
Given a classical theory T, a Kripke model K for the language L of T is called T-normal or locally PA just in case the classical L-structure attached to each node of K is a classical model of T. Van Dalen, Mulder, Krabbe, and Visser showed that Kripke models of Heyting Arithmetic (HA) over finite frames are locally PA, and that Kripke models of HA over frames ordered like the natural numbers contain infinitely many PA-nodes. We show that Kripke models (...) of the latter sort are in fact PA-normal. This result is extended to a somewhat larger class of frames. (shrink)
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. (shrink)
In the Tractatus, Wittgenstein advocates two major notational innovations in logic. First, identity is to be expressed by identity of the sign only, not by a sign for identity. Secondly, only one logical operator, called “N” by Wittgenstein, should be employed in the construction of compound formulas. We show that, despite claims to the contrary in the literature, both of these proposals can be realized, severally and jointly, in expressively complete systems of first-order logic. Building on early work of Hintikka’s, (...) we identify three ways in which the first notational convention can be implemented, show that two of these are compatible with the text of the Tractatus, and argue on systematic and historical grounds, adducing posthumous work of Ramsey’s, for one of these as Wittgenstein’s envisaged method. With respect to the second Tractarian proposal, we discuss how Wittgenstein distinguished between general and non-general propositions and argue that, claims to the contrary notwithstanding, an expressively adequate N-operator notation is implicit in the Tractatus when taken in its intellectual environment. We finally introduce a variety of sound and complete tableau calculi for first-order logics formulated in a Wittgensteinian notation. The first of these is based on the contemporary notion of logical truth as truth in all structures. The others take into account the Tractarian notion of logical truth as truth in all structures over one fixed universe of objects. Here the appropriate tableau rules depend on whether this universe is infinite or finite in size, and in the latter case on its exact finite cardinality. As it is obviously easy to express how propositions can be constructed by means of this operation and how propositions are not to be constructed by means of it, this must be capable of exact expression. 5.503. (shrink)
(2012). Gingerbread Nuts and Pebbles: Frege and the Neo-Kantians – Two Recently Discovered Documents. British Journal for the History of Philosophy. ???aop.label???. doi: 10.1080/09608788.2012.692665.
In ‘Eliminating Identity: A Reply to Wehmeier’, Robert Trueman attacks my claim that a commitment to a binary relation of identity is logically unnecessary and philosophically undesirable. I show that his two most serious objections are unconvincing.
We provide an overview of consistent fragments of the theory of Frege’s Grundgesetze der Arithmetik that arise by restricting the second-order comprehension schema. We discuss how such theories avoid inconsistency and show how the reasoning underlying Russell’s paradox can be put to use in an investigation of these fragments.
In a letter to Frege of 29 December 1899, Hilbert advances his formalist doctrine, according to which consistency of an arbitrary set of mathematical sentences is a sufficient condition for its truth and for the existence of the concepts described by it. This paper discusses Frege's analysis, as carried out in the context of the Frege-Hilbert correspondence, of the formalist approach in particular and the axiomatic method in general. We close with a speculation about Frege's influence on Hilbert's later work (...) in foundations, which we consider to have been greater than previously assumed. This conjecture is based on a hitherto neglected revision of Hilbert's talk "Über den Zahlbegriff". (shrink)
All contributions included in the present issue were originally presented at an ‘Author Meets Critics’ session organised by Richard Zach at the Pacific Meeting of the American Philosophical Association in San Diego in the Spring of 2014.
I examine notions of equivalence between logics and develop two new ones that invoke not only the algebraic but also the string-theoretic structure of the underlying language. As an application, I show how to construe modal operator languages as what might be called typographical notational variants of bona fide first-order languages.
The aim of the present study is 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 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. (shrink)