Search

One of the central logical ideas in Wittgenstein's Tractatus logico-philosophicus is 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 ∧ b = c → 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 a single formula of Wittgenstein's exclusive notation. Instead, there will often be a multiplicity of possible translations, revealing the original "inclusive" formulas to be ambiguous. (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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In contrast to Hintikka's enormously complex distributive normal forms of first-order logic, this article shows how to generate minimized disjunctive normal forms of first-order logic. An effective algorithm for this purpose is outlined, and the benefits of using minimized disjunctive normal forms to explain the truth conditions of propositions expressible within pure first-order logic are presented. [ABSTRACT FROM AUTHOR]