Wittgenstein's Tractatus logic translates directly into modern truth-functional logic
the verdict
INSUFFICIENT LEANING
refutedsupported
the weight of evidence
4 sources for · 0 against
The available literature shows that Wittgenstein's Tractatus introduced early versions of truth tables and truth-functional operations, but specialized studies only partially cover the complex relationship between Tractarian notation and modern truth-functional logic.
Abstract 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
WEHMEIER Show author details BRIAN ROGERS* Affiliation: Logic & Philosophy of Science, UC Irvine KAI F. WEHMEIER* Affiliation:
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.
Identity, variables, and impredicative definitions . Journal of Symbolic Logic , 21 , 225 – 245 . Google Scholar Jacquette , D. ( 2001 ). Analysis of quantifiers in Wittgenstein’s Tractatus : A critical survey . Logical Analysis and History of Philosophy , 4 , 191 – 202 . CrossRef Google Scholar Kremer , M. ( 2007 ). The cardinal problem of philosophy . In Crary , A. , editor. Wittgenstein and the Moral Life: Essays in Honor of Cora Diamond . Cambridge, MA : MIT Press , pp. 143 – 176 . Google Scholar Landini , G. ( 2007 ). Wittgenstein’s Apprenticeship with Russell . New York, NY : Cambridge University Press . Google Scholar McGray , J. ( 2006 ).
The power and the limits of Wittgenstein’s N operator . History and Philosophy of Logic , 27 ( 2 ), 143 – 169 . CrossRef Google Scholar McGuinness , B. , editor. ( 2008 ). Wittgenstein in Cambridge: Letters and Documents 1911–1951 . Oxford, UK : Blackwell . CrossRef Google Scholar Miller , H. ( 1995 ). Tractarian semantics for predicate logic . History and Philosophy of Logic , 16 ( 2 ), 197 – 215 . Google Scholar Morris , M. ( 2008 ). Wittgenstein and the Tractatus . London : Routledge . Google Scholar Ramsey , F. P . ( 1923 ). Critical notice of the Tractatus . Mind , 32 , 465 – 478 . Google Scholar Ramsey , F. P . ( 1991 ). Identity . In Galavotti , M. , editor.
Notes on Philosophy, Probability and Mathematics . Naples, Italy : Bibliopolis , pp. 155 – 169 . Google Scholar Schroeder , S. ( 2006 ). Wittgenstein . Cambridge, UK : Polity . Google Scholar Smullyan , R. M . ( 1968 ). First-Order Logic . New York, NY : Springer-Verlag . Google Scholar Soames , S. ( 1983 ). Generality, truth functions, and expressive capacity in the Tractatus . The Philosophical Review , 92 ( 3 ), 573 – 589 . Google Scholar Sundholm , G. ( 1992 ). The general form of the operation in Wittgenstein’s Tractatus . Grazer Philosophische Studien , 42 , 57 – 76 . Google Scholar Varga von Kibéd , M. ( 1993 ). Variablen im Tractatus . Erkenntnis , 39 , 79 – 100 .
CrossRef Google Scholar Wehmeier , K. F . ( 2004 ). Wittgensteinian predicate logic . Notre Dame Journal of Formal Logic , 45 , 1 – 11 . Google Scholar Wehmeier , K. F . ( 2008 ). Wittgensteinian tableaux, identity, and co-denotation . Erkenntnis , 69 , 363 – 376 . Google Scholar Wehmeier , K. F . ( 2009 ). On Ramsey’s ‘Silly Delusion’ regarding Tractatus 5.53 . In Primiero , G. , and Rahman , S. , editors. Acts of Knowledge: History, Philosophy and Logic . London : College Publications , pp. 353 – 368 . Google Scholar White , R. ( 2006 ). Wittgenstein’s Tractatus Logico-Philosophicus . London : Continuum . Google Scholar Whitehead , A. N. , & Russell , B. ( 1910 ).
Tables of truth are tools used in evaluating logical expressions and proving arguments. The name comes from the factual nature of the mathematical table in which all possible outcomes are represented. The Tractus Logico-Philosophicus, written by Ludwig Wittgenstein in 1918 and published in 1921, is largely credited for creating and popularizing the truth table. Truth Table Generator is a program which provides a truth table for the propositional logic expression entered by the user and also confirms whether the given expression is a tautology or not. Mathematics and science that rely on Boolean logic also use truth tables to show the truth or falsity of expressions or operations. This paper contains the proposed idea for evaluating and generating truth tables for propositions using python.
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.
Everything we examined (4)
This check searched the claim as stated. It did not run a separate search for evidence against it.