Analysis of quantifiers in Wittgenstein's Tractatus. A critical survey In the Tractatus Logico-Philosophicus, Wittgenstein distinguishes between what can and cannot be said in any language by the general form of propositions. I explain Wittgenstein's method and discuss Robert J. Fogelin's criticism of what he takes to be the incompleteness of Wittgenstein's general form of propositions in his exposition of the 'Naive Constructivism of the Tractatus.' I argue that Fogelin's objection is mistaken, and that, contrary to Fogelin's claim, Wittgenstein's method when (...) properly applied produces all of the well-formed formulas with mixed multiple quantification that Fogelin maintains it cannot provide. I conclude by offering a critical comparison of similar solutions proposed, among others, by P.T. Geach, Scott Soames, and Matthias Varga von Kibéd. (shrink)

In theTractatus, 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 theTractatus, 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 theTractatuswhen 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)

I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...) infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory. -/- Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects. (shrink)

In Carnap’s autobiography, he tells the story how one night in January 1931, “the whole theory of language structure” in all its ramifications “came to [him] like a vision”. The shorthand manuscript he produced immediately thereafter, he says, “was the first version” of Logical Syntax of Language. This document, which has never been examined since Carnap’s death, turns out not to resemble Logical Syntax at all, at least on the surface. Wherein, then, did the momentous insight of 21 January 1931 (...) consist? We seek to answer this question by placing Carnap’s shorthand manuscript in the context of his previous efforts to accommodate scientific theories and metalinguistic claims within Wittgenstein’s Tractatus theory of meaning. The breakthrough of January 1931 consists, from this viewpoint, in the rejection of the Tractatus theory in favor of the meta-mathematical perspective of Hilbert, Gödel, and Tarski. This was not yet the standpoint of the published Logical Syntax, as we show, but led naturally to the “principle of tolerance” and thus to Carnap’s mature philosophy, in which the inconsistencies between this first view and the principle of tolerance, which survived into the published Syntax, were overcome. (shrink)

In his Tractatus, Wittgenstein maintained that arithmetic consists of equations arrived at by the practice of calculating outcomes of operations$\Omega ^{n}(\bar {\xi })$defined with the help of numeral exponents. Since$Num$(x) and quantification over numbers seem ill-formed, Ramsey wrote that the approach is faced with “insuperable difficulties.” This paper takes Wittgenstein to have assumed that his audience would have an understanding of the implicit general rules governing his operations. By employing the Tractarian logicist interpretation that theN-operator$N(\bar {\xi })$and recursively defined arithmetic (...) operators$\Omega ^{n}(\bar {\xi })$are not different in kind, we can address Ramsey’s problem. Moreover, we can take important steps toward better understanding how Wittgenstein might have imagined emulating proof by mathematical induction. (shrink)

Wittgenstein's "Tractatus" claims the possibility to represent quantificational logic by means of a single basic operation. Fogelin regards the "Tractatus" system as seriously flawed and thus not suited for this aim, while Geach and Soames propose extensions and corrections of the Tractarian notational system. If the unusual Tractarian view -- every variable can be conceived as a propositional variable -- is taken full account of, we find out, that the "Tractatus" system is well suited to deal even with the problematic (...) cases of mixed quantifiers with many-place predicates. By expanding the view of variables as certain two-dimensional lists of propositions we find adequate representations of formulas like fxy in the logic of the "Tractatus". Surprisingly we don't need anything which corresponds to formulas with two or more free variables like fxy, and still get the full power of ordinary quantificational logic. (shrink)

The purpose of this paper is threefold. First, I visit the Fogelin–Geach-dispute, criticizeMiller''s interpretation of the Geachian notationN(x:N(fx)) and conclude that Fogelin''s argumentagainst the expressive completeness of the Tractariansystem of logic is unacceptable and that the adoptionof the Geachian notation N(x:fx) would not violate TLP5.32. Second, I prove that a system of quantificationtheory with finite domains and with N as the solefundamental operation is expressively complete. Lastly, I argue that the Tractarian system is apredicate-eliminated many-sorted theory (withoutidentity) with finite domains (...) and with N as the solefundamental operation, and thus is expressivelycomplete. (shrink)

Cora Diamond has recently criticised as mere legend the interpretation of a quip of Ramsey's, contained in the epigraph below, which takes him to be objecting to or rejecting Wittgenstein's Tractarian distinction between saying and showing. Whilst I agree with Diamond's discussion of the legend, I argue that her interpretation of the quip has little evidential support, and runs foul of a criticism sometimes made against intuitionism. Rather than seeing Ramsey as making a claim about the nature of propositions, as (...) Diamond does, we should understand him as making a claim about the grammar of the logical connectives. Such a view coheres with the extant evidence of the nature of Wittgenstein's and Ramsey's 1929 philosophical encounters. It is also compatible with attributing to Ramsey a recognition of Wittgenstein's distinction and with denying that criticising it is the lesson of the quip. (shrink)

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...

Wittgenstein's conception of the general form of a truth function given in thesis 6 can be presented as a sort of a trade-off: the author of the Tractatus is unable to reconcile the simplicity of his original idea of a series of forms with the simplicity of his generalisation of Sheffer's stroke; therefore, he is forced to sacrifice one of them. As we argue in this paper, the choice he makes – to weaken the logical constraints put on the concept (...) of a series of forms, thus effectively metaphorising that concept for the sake of upholding the N-operation's role of generating the series – is unfortunate. An actual expansion of a series of truth functions as defined in 6 would require either making decisions at each step (Anscombe) or outwardly rejecting the concept of a series (Sundholm). However, neither is faithful to Wittgenstein's own fundamental intuitions regarding the nature of logic. For this reason, a different trade-off that prioritises upholding the basic features of a series of forms over the simplicity of the operation that generates that series seems to be much more reasonable. We offer such a trade-off by developing the schema already present in the Tractatus (5.101). The key element of our alternative solution is the construction of an operation that can perform the task of producing all consecutive truth functions of a given collection of atomic propositions as an invariant difference between any base and its successor throughout the series. We define it as a composition of three functions (in an algebraic sense): the first turns a symbol of a given truth function into a binary number, the second increments that number, the third turns the result back into a symbol of another truth function. We also show how the operation can be defined by means of a different notation without invoking binary arithmetic. (shrink)

The power of Wittgenstein's N operator described in the Tractatus is that every proposition which can be expressed in the Russellian variant of the predicate calculus familiar to him has an equivalent proposition in an extended variant of his N operator notation. This remains true if the bound variables are understood in the usual inclusive sense or in Wittgenstein's restrictive exclusive sense. The problematic limit of Wittgenstein's N operator comes from his claim that symbols alone reveal the logical status of (...) propositions. This would require knowledge of the size of the Tractarian domain of unchangeable, simple objects, and this, Wittgenstein maintained, cannot be known. (shrink)

In this paper, I aim to shed light on the use of transcendental deductions, within demonstrations of aspects of Wittgenstein's early semantics, metaphysics, and philosophy of mathematics. I focus on two crucial claims introduced by Wittgenstein within these transcendental deductions, each identified in conversation with Desmond Lee in 1930-31. Specifically, the claims are of the logical independence of elementary propositions, and that infinity is a number. I show how these two, crucial claims are both demonstrated and subsequently deployed by Wittgenstein (...) within a series of transcendental deductions, a series which begins with extensionalism as a generalized condition of sense on propositions, and in the context of which are then derived various, further, significant and unobvious presuppositions generated by that generalized condition of sense. In addition to clearing up deductions of these two, aforementioned claims, I also elucidate deductions of the subsistence of objects, and of logical space as an infinite totality. (shrink)

The present text discusses whether there is a tension between aphorisms 6.1-6.13 of the Tractatus and the Church-Turing theorem about the decidability of predicate logic. We attempt to establish the following points: (i) Aphorisms 6.1-6.13 are not consistent with the Church-Turing theorem. (ii) The logical symbolism of the Tractatus, built from the N-operator, can (and should) be interpreted as expressively complete with respect to first-order formulas. (iii) Wittgenstein’s reasons for believing that Logic is decidable were purely philosophical and the undecidability (...) result shows that there are aspects of his criticisms of Frege and Russell that become unjustified in light of these results. (shrink)