This paper systematically outlines Wittgenstein's ab-notation. The purpose of this notation is to provide a proof procedure in which ordinary logical formulas are converted into ideal symbols that identify the logical properties of the initial formulas. The general ideas underlying this procedure are in opposition to a traditional conception of axiomatic proof and are related to Peirce's iconic logic. Based on Wittgenstein's scanty remarks concerning his ab-notation, which almost all apply to propositional logic, this paper explains how to extend his (...) method to a subset of first-order formulas, namely, formulas that do not contain dyadic sentential connectives within the scope of any quantifier. (shrink)

In this paper, I provide a new reading of Wittgenstein’s N operator, and of its significance within his early logical philosophy. I thereby aim to resolve a longstanding scholarly controversy concerning the expressive completeness of N. Within the debate between Fogelin and Geach in particular, an apparent dilemma emerged to the effect that we must either concede Fogelin’s claim that N is expressively incomplete, or reject certain fundamental tenets within Wittgenstein’s logical philosophy. Despite their various points of disagreement, however, Fogelin (...) and Geach nevertheless share several common and problematic assumptions regarding Wittgenstein’s logical philosophy, and it is these mistaken assumptions which are the source of the dilemma. Once we recognize and correct these, and other, associated expository errors, it will become clear how to reconcile the expressive completeness of Wittgenstein’s N operator, with several commonly recognized features of, and fundamental theses within, the Tractarian logical system. (shrink)

Russell's notion of an incomplete symbol has become a standard against which philosophers compare their views on the relationship between language and the world. But Russell's exact characterization of incomplete symbols and the role they play in his philosophy are still disputed. In this paper, I trace the development of the notion of an incomplete symbol in Russell's philosophy. I suggest – against Kaplan, Evans, and others – that Russell's many characterizations of the notion of an incomplete symbol are compatible. (...) To this end, I examine and reject arguments for the purported incompatibility between declaring an expression to be incomplete and incorporating that symbol into a compositional semantic theory. I then examine how Russell puts the notion of an incomplete symbol to use in metaphysics. (shrink)

This paper investigates Wittgenstein’s account of the relation between elementary and molecular propositions (and thus, also, the propositions of logic) in the Tractatus Logico-Philosophicus. I start by sketching a natural reading of that relation – which I call the “bipartite reading” – holding that the Tractatus gives an account of elementary propositions, based on the so-called picture theory, and a different account of molecular ones, based on the principle of truth- functionality. I then show that such a reading cannot be (...) attributed to Wittgenstein, because he holds the view that an explanation of logical complexity is already given by a correct account of the (pictorial) nature of elementary propositions; this is implied in his claim that “an elementary proposition contains all logical constants/operations in itself”. After clarifying Wittgenstein’s notion of an operation from the Notes on Logic to the Tractatus, I finally explain why Wittgenstein claims that an elementary proposition contains all logical operations in itself, and hence why he can be said to provide a unified (and thus not bipartite) account of language and logic. (shrink)

Between April and November 1912, Bertrand Russell and Ludwig Wittgenstein were engaged in a joint philosophical program. Wittgenstein‘s meeting with Gottlob Frege in December 1912 led, however, to its dissolution – the joint program was abandoned. Section 2 of this paper outlines the key points of that program, identifying what Russell and Wittgenstein each contributed to it. The third section determines precisely those features of their collaborative work that Frege criticized. Finally, building upon the evidence developed in the preceding two (...) sections, section 4 recasts along previously undeveloped lines Wittgenstein‘s logical–philosophical discoveries in the two years following his encounter with Frege in 1912. The paper concludes, in section 5, with an overview of the dramatic consequences the Frege-Wittgenstein critique had for Russell‘s philosophical development. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

The article contains a critical analysis of Wittgenstein’s theory of logical symbolism. According to an influential interpretation, Wittgenstein presented in the Tractatus a new method of solving paradoxes. This method seems a simple and effective alternative to Russell’s type theory. Wittgenstein’s theory of logical symbolism is based on the requirement of clear notation and the context principle: the type of a symbol only “shows” itself in the way we use the signs of our language. The function sign φ(φx) does not (...) express any paradox, because the syntactic rules for its use, written in clear notation, should “show” us that φ(φx) = ψ(φx). Many researchers (Davant, Ishiguro, Mounce, Ruffino, Friedlander, Jolley, Livingston, Ladov, et al.) follow this interpretation. However, the difficulty of such a view on Wittgenstein’s theory of logical symbolism is that there hides the fallacy of petitio principii. Indeed, in examples of a functional sign of the form φ(φx), we are interested not only in the question of whether the functions φ are different symbols, but also in how this functional sign φ(φx) itself excludes the symbolization of the same object by different ways. This interpretation is contrasted with the idea that Wittgenstein’s theory of logical symbolism is in fact a modified analogue of Russell’s simple theory of types. The reciprocality principle becomes the core of Wittgenstein’s theory: the combinatorial potential of the “prototype” of a functional sign is identical to the combinatorial potential of the “prototype” of an argument. According to Wittgenstein, only describing the combinatorial potential of linguistic expressions (symbols) can vanish the illusion of paradoxes. The function cannot be its argument, because the function sign φ(φx) already contains the “prototype” of its argument, “showing” us that φ(φx) = φx. The correctness of this interpretation does not exclude the possibility that the differences between Russell and Wittgenstein are in fact nothing more than façon de parler. (shrink)

In this excellent book Sebastien Gandon focuses mainly on Russell's two major texts, Principa Mathematica and Principle of Mathematics, meticulously unpicking the details of these texts and bringing a new interpretation of both the mathematical and the philosophical content. Winner of The Bertrand Russell Society Book Award 2013.

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

In his highly perceptive, if underappreciated introduction to Wittgenstein’s Tractatus, Russell identifies a “lacuna” within Wittgenstein’s theory of number, relating specifically to the topic of transfinite number. The goal of this paper is two-fold. The first is to show that Russell’s concerns cannot be dismissed on the grounds that they are external to the Tractarian project, deriving, perhaps, from logicist ambitions harbored by Russell but not shared by Wittgenstein. The extensibility of Wittgenstein’s theory of number to the case of transfinite (...) cardinalities is, I shall argue, a desideratum generated by concerns intrinsic, and internal to Wittgenstein’s logical and semantic framework. Second, I aim to show that Wittgenstein’s theory of number as espoused in the Tractatus is consistent with Russell’s assessment, in that Wittgenstein meant to leave open the possibility that transfinite numbers could be generated within his system, but did not show explicitly how to construct them. To that end, I show how one could construct a transfinite number line using ingredients inherent in Wittgenstein’s system, and in accordance with his more general theories of number and of operations. (shrink)

In the Foundations of Mathematics, Ramsey attempted to amend Principia Mathematica’s logicism to meet serious objections raised against it. While Ramsey’s paper is well known, some questions concerning Ramsey’s motivations to write it and its reception still remain. This paper considers these questions afresh. First, an account is provided for why Ramsey decided to work on his paper instead of simply accepting Wittgenstein’s account of mathematics as presented in the Tractatus. Secondly, evidence is given supporting that Wittgenstein was not moved (...) by Ramsey’s objection against the Tractarian account of arithmetic, and a suggestion is made to explain why Wittgenstein reconsidered Ramsey’s account in the early thirties on several occasions. Finally, a reading is formulated to understand the basis on which Wittgenstein argues against Ramsey’s definition of identity in his 1927 letter to Ramsey. (shrink)

Expressively equivalent logical languages can enunciate logical notions in notationally diversified ways. Frege’s Begriffsschrift, Peirce’s Existential Graphs, and the notations presented by Wittgenstein in the Tractatus all express the sentential fragment of classical logic, each in its own way. In what sense do expressively equivalent notations differ? According to recent interpretations, Begriffsschrift and Existential Graphs differ from other logical notations because they are capable of “multiple readings.” We refute this interpretation by showing that there are at least three different kinds (...) of such multiple readings. While readings of the first kind do not capture any essential difference among notations but only among vocabularies, corresponding to readings of the second and the third kind two general parameters according to which notations may differ are defined: linearity vs. non-linearity, and tabularity vs. non-tabularity. This answers the question of how there can be substantially different but expressively equivalent logical notations. (shrink)

I characterize and argue against the standard interpretation of logical atomism. The argument against this reading is historical: the standard interpretation of logical atomism (1) fails to explain how the view is inspired by nineteenth-century developments in mathematics, (2) fails to explain how logic is central to logical atomism, and (3) fails to explain how logical atomism is a revolutionary and new "scientific philosophy." In short, the standard interpretation is a bad history of logical atomism. A novel interpretation of the (...) view that repairs these difficulties is sketched in the concluding section. (shrink)

In his Tractatus, Wittgenstein sets out what he calls his N-operator notation which can be used to calculate whether an expression is a tautology. In his Laws of Form, George Spencer Brown offers what he calls a “primary algebra” for such calculation. Both systems are perplexing. But comparing two blurry images can reduce noise, producing a focus. This paper reveals that Spencer Brown independently rediscovered the quantifier-free part of the N-operator calculus. The comparison sheds a flood light on each and (...) from the letters of correspondence we shall find that Russell, as one might have surmised, was a catalyst for both. (shrink)

One of the central logical ideas in Wittgenstein’sTractatus logico-philosophicusis the elimination of the identity sign in favor of the so-called “exclusive interpretation” of names and quantifiers requiring different names to refer to different objects and (roughly) different variables to take different values. In this paper, we examine a recent development of these ideas in papers by Kai Wehmeier. We diagnose two main problems of Wehmeier’s account, the first concerning the treatment of individual constants, the second concerning so-called “pseudo-propositions” (Scheinsätze) of (...) classical logic such as$a=a$or$a=b \wedge b=c \rightarrow a=c$. We argue that overcoming these problems requires two fairly drastic departures from Wehmeier’s account: (1) Not every formula of classical first-order logic will be translatable into asingleformula of Wittgenstein’s exclusive notation. Instead, there will often be a multiplicity of possible translations, revealing the original “inclusive” formulas to beambiguous. (2) Certain formulas of first-order logic such as$a=a$will not be translatable into Wittgenstein’s notation at all, being thereby revealed as nonsensical pseudo-propositions which should be excluded from a “correct” conceptual notation. We provide translation procedures from inclusive quantifier-free logic into the exclusive notation that take these modifications into account and define a notion of logical equivalence suitable for assessing these translations. (shrink)

Bertrand Russell: Logic For Russell, Aristotelian syllogistic inference does not do justice to the subject of logic. This is surely not surprising. It may well be something of a surprise, however, to learn that in Russell’s view neither Boolean algebra nor modern quantification theory do justice to the subject. For Russell, logic is a synthetic … Continue reading Russell: Logic →.

Wittgenstein’s N-operator is a ‘primitive sign’ which shows every complex proposition is the result of the truth-functional combination of a finite number of component propositions, and thus provid...

Jeffrey King, Scott Soames, and others have recently challenged the familiar identification of a Russellian proposition, such as the proposition that Brutus stabbed Caesar, with an ordered sequence constructed out of objects, properties, and relations. There is, as they point out, a surplus of candidate sequences available that are each equally serviceable. If so, any choice among these candidates will be arbitrary. In this paper, I show that, unless a controversial assumption is made regarding the nature of nonsymmetrical relations, none (...) of the proffered candidate sequences are in fact adequate to the play the role. Moreover, as I argue, the most promising alternative theory of relations—one that avoids the problematic assumption and, in addition, fits most naturally into the sequentialist’s framework—fails to meet a basic requirement: it cannot distinguish between the proposition that Brutus stabbed Caesar and the proposition that Caesar stabbed Brutus. The upshot is that the conspicuously structured entities that are widely assumed to be up to the task of “playing the proposition role” shed no light on the very structure they are invoked to represent. (shrink)

Principia Mathematic goes to great lengths to hide its order/type indices and to make it appear as if its incomplete symbols behave as if they are singular terms. But well-hidden as they are, we cannot understand the proofs in Principia unless we bring them into focus. When we do, some rather surprising results emerge ? which is the subject of this paper.

Drawing on Russell's substitutional theory, this paper examines the notion of ‘structured variable’, in order to compare Russell's and Tarski's conceptions of variables. The framework of syntactic fibrations, coming from categorical logic, is used as a common setting. The main objective of this paper is to make sense of the notion of structured variable beyond the context of Russell's theory, to question the Tarskian way of understanding what it is to be a possible value for a variable, and to bring (...) out semantically structured variables as a renewed and fruitful way of conceiving of logical structure. (shrink)

Bernard Linsky, The Evolution of Principia Mathematica; Bertrand Russell's Manuscripts and Notes for the Second Edition. Cambridge: Cambridge University Press. 2011. 407 pp. + two plates. $150.00/£...

In this article, I examine the ramified-type theory set out in the first edition of Russell and Whitehead's Principia Mathematica. My starting point is the ‘no loss of generality’ problem: Russell, in the Introduction (Russell, B. and Whitehead, A. N. 1910. Principia Mathematica, Volume I, 1st ed., Cambridge: Cambridge University Press, pp. 53–54), says that one can account for all propositional functions using predicative variables only, that is, dismissing non-predicative variables. That claim is not self-evident at all, hence a problem. (...) The purpose of this article is to clarify Russell's claim and to solve the ‘no loss of generality’ problem. I first remark that the hierarchy of propositional functions calls for a fine-grained conception of ramified types as propositional forms (‘ramif-types’). Then, comparing different important interpretations of Principia’s theory of types, I consider the question as to whether Principia allows for non-predicative propositional functions and variables thereof. I explain how the distinction between the formal system of the theory, on the one hand, and its realizations in different epistemic universes, on the other hand, makes it possible to give us a more satisfactory answer to that question than those given by previous commentators, and, as a consequence, to solve the ‘no loss of generality’ problem. The solution consists in a substitutional semantics for non-predicative variables and non-predicative complex terms, based on an epistemic understanding of the order component of ramified types. The rest of the article then develops that epistemic understanding, adding an original epistemic model theory to the formal system of types. This shows that the universality sought by Russell for logic does not preclude semantical considerations, contrary to what van Heijenoort and Hintikka have claimed. (shrink)

On investigating a theorem that Russell used in discussing paradoxes of classes, Graham Priest distills a schema and then extends it to form an Inclosure Schema, which he argues is the common structure underlying both class-theoretical paradoxes (such as that of Russell, Cantor, Burali-Forti) and the paradoxes of ?definability? (offered by Richard, König-Dixon and Berry). This article shows that Russell's theorem is not Priest's schema and questions the application of Priest's Inclosure Schema to the paradoxes of ?definability?.1 1?Special thanks to (...) Francesco Orilia for criticisms of an early draft of this article. (shrink)

What is logical relevance? Anderson and Belnap say that the “modern classical tradition [,] stemming from Frege and Whitehead-Russell, gave no consideration whatsoever to the classical notion of relevance.” But just what is this classical notion? I argue that the relevance tradition is implicitly most deeply concerned with the containment of truth-grounds, less deeply with the containment of classes, and least of all with variable sharing in the Anderson–Belnap manner. Thus modern classical logicians such as Peirce, Frege, Russell, Wittgenstein, and (...) Quine are implicit relevantists on the deepest level. In showing this, I reunite two fields of logic which, strangely from the traditional point of view, have become basically separated from each other: relevance logic and diagram logic. I argue that there are two main concepts of relevance, intensional and extensional. The first is that of the relevantists, who overlook the presence of the second in modern classical logic. The second is the concept of truth-ground containment as following from in Wittgenstein’s Tractatus. I show that this second concept belongs to the diagram tradition of showing that the premisses contain the conclusion by the fact that the conclusion is diagrammed in the very act of diagramming the premisses. I argue that the extensional concept is primary, with at least five usable modern classical filters or constraints and indefinitely many secondary intensional filters or constraints. For the extensional concept is the genus of deductive relevance, and the filters define species. Also following the Tractatus, deductive relevance, or full truth-ground containment, is the limit of inductive relevance, or partial truth-ground containment. Purely extensional inductive or partial relevance has its filters or species too. Thus extensional relevance is more properly a universal concept of relevance or summum genus with modern classical deductive logic, relevantist deductive logic, and inductive logic as its three main domains. (shrink)