trustme.bro/r/…
✓ checked
trust me, bro:
here is the receipt.
the claim
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.

Evidence for · 4
2012 · cited by 29
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 ).
See more details
The analysis

rails:sufficiency:partial_only:for=0+4p:against=0+0p | v55:multi_partial_one_side:lean=lean_partial:for:one_sided

More for · 3
2024 · cited by 0
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.
2020 · cited by 0
The objective of this paper is to present the truth tables method of the propositional calculus of Tractatus Logico-Philosophicus as a result of computational procedures involving recursive operations in mathematics, since the secondary literature that is involved with such a problem fails to demonstrate such aspect of the work. The proposal is to demonstrate the base calculation of the truth operations as a consequence of the application of mathematical resources that involve the notion of recursivity, inspired both in the natural numbers as well as in the factorial calculus, as well as in the procedures recommended by the combinatorial analysis and the calculation of probability. It is hoped, therefore, to present the truth operations of the propositional calculus as coming from the application of arithmetic to the logical resources. © Dissertatio [50] 383-3972019 TRUTH OPERATIONS AND LOGICAL-MATHEMATICAL RECURSIVITY ON THE PROPOSITIONAL CALCULUS BASIS OF THE TRACTATUS OF L. WITTGENSTEIN Eduardo Simões Federal University of Tocantins Aline Aquino Alves Federal University of Tocantins Leandro de Oliveira Pires Federal University of Tocantins Abstract: The objective of this paper is to present the truth tables method of the propositional calculus of Tractatus Logico-Philosophicus as a result of computational procedures involving recursive operations in mathematics, since the The proposal is to demonstrate the base calculation of the truth operations as a consequence of the application of mathematical resources that involve the notion of recursivity , inspired both in the natural numbers as well as in the factorial calculus, as well as in the procedures recommended by the combinato rial analysis and the calculation of probability. It is hoped, therefore, to present the truth operations of the propositiona l calculus as coming from the application of arithmetic to the logical resources. Keywords: Operations of truth, propositional calculus, recursivity, Logic, Mathematics, Tractatus, Wittgenstein. 1 It was said by Wittgenstein on the Letters to Russell, summer 1912 – 1.13, that are reunited at: WRIGHT, G. H. von (org.). Letters to Russell, Keynes and Moore. B. F. McGuinness. Oxford: Blackwell, 1974. Eduardo Simões, Aline Aquino Alves, Leandro de Oliveira Pires 384 Even if the table was not completely filled in the example given by the Tractatus, it is known from the presentation of the “ propositional sign”, “(TTFT) (p, q)” (TLP 4.442), that it is about the truth function “ p⊃q”. In this case, “ p⊃q” has three fundamentals of truth [(VV), (FT), (FF)] and its truth conditions are (TTFT). The particularity of the truth tables proposed by Wittgenstein in relation to the models we find in the current logic manuals is that they appear in Tractatus in quotation marks and do not present the proposition at the top of the right column. This means that: i) they do not define propositional connectives, ii) they do not specify the truth conditions of molecular propositions, and iii) they are propositional signs that express molecular propositions without resorting to constants (as Wittgenstein calls i t), or connectives or logical operators. Truth tables emerge from the evolution of Wittgenstein's thinking while seeking an alternative to Frege and Russell's truth-functional notation, since he identified that in such notation, sentences that had been treated as distinct constitute a single symbol. Frege and Russell presented alternative ways of writing the same proposition 2. The first path proposed by Frege and Russell's truth-functional notation was “ab notation”. In Notes on Logic (NL), Wittgenstein says what such notation consists of: As the ab (TF)-functions of atomic propositions are bi -polar propositions again, we can perform ab operations on them. Then two letters T and F to these poles. The second path proposed by Wittgenstein to Frege and Russell's truth -functional notation was a two - dimensional variation of the ab variation that, according to him, can display the connections between the poles of molecular and atomic propositions that constitute them. This procedure is presented in a letter addressed to Russell between November and December 1913. According to Wittge nstein, it is a procedure that distinguishes tautologies, contradictions, and contingencies; it is taken up in aphorism 6.1203 of the Tractatus. As it will be seen, such tables are the consequence of the application of two mathematical formulas proposed by Wittgenstein in the Tractatus, namely: The purpose of applying the equations in Tractatus are: a) To calculate the fixed combinatorial number of possibilities of truth, the possibilities for n elementary propositions (corresponding to n state of affairs); b) To calculate the number of molecular propositions from the number of possibilities of truth. The combinatorial analysis is widely used by probability and logic scholars, as it allows working with groups of events that are directly related to counting, and Wittgenstein work s with this feature, which he knew very well as a mechanical engineer, to calculate the conditions of possibility of existence and nonexistence of states of affairs, as well as to deal with the agreement and disagreement of a proposition with the truth possibilities of n elementary propositions. Counting the subset count of the Sample Space S = {p, q}, where each subset represents a column of the truth table, for: , we have: 0 ( ) ∑ ( ) =0 ∑ ( ) =0 ∑ ( ) =0 ∑ ( ) =0 ( ) ( ) ( ) ( ) ( ) ∑ ( ) =0 0 ∑ ( K) =0 ∑ ( K ) =0 ∑ ( K) =0 ∑ ( ) =0 { } ∈ Dissertatio [50] 381-3972019 397 ∑ ( ) =0 { } ∈ Given the large gap left by the interpreters of Wittgenstein's Tractatus in demonstrating the foundations of the propositional calculus of the work from the foundations of mathematics, what was meant here was to demonstrate that the truth table method is p art of a common procedure in the calculation that is based on recursive mathematical operations.
2023 · cited by 0
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.
  1. Truth Table Generatorpeer-reviewedno side taken
  2. Truth Operations and Logical-Mathematical Recursivity on the Propositional Calculus Basis of the Tractatus of L. Wittgensteinpeer-reviewedno side taken
  3. TRACTARIAN FIRST-ORDER LOGIC: IDENTITY AND THE N-OPERATORpeer-reviewedno side taken
  4. Tractatus 6 Reconsidered: An Algorithmic Alternative to Wittgenstein's Trade-Offpeer-reviewedno side taken
The paper trail · every fact has a biography
held for human review08 Aug 2026
This receipt carries no identity, shared or not. Sharing publishes your connection to it, not your data.
Check your own claim
Challenge the receipt
trust me, bro: win the argument, pass the class, survive peer review.
This receipt is an automated verdict against our published method · not an opinion about any author or publication.
Terms · Privacy · How verdicts work · Dispute this receipt