As an undergraduate I was taught to multiply two numbers with the help of log tables, using the formulaHaving graduated to teach calculus to Engineers, I learned that log tables were to be replaced by slide rules. It was then that Imade the fateful decision that there was no need for me to learn how to use this tedious device, as I could always rely on the students to perform the necessary computations. In the course of time, slide rules were (...) replaced by pocket calculators and personal computers, but I stuck to my original decision.My computer phobia did not prevent me from taking an interest in the theoretical question: what is a computation? This question goes back to Hilbert's 10th problem, which asks for an algorithm, or computational procedure, to decide whether any given polynomial equation is solvable in integers. It quickly leads to the related question: which numerical functionsf: ℕn→ ℕ are computable?While Hilbert's 10th problem was only resolved in 1970, this related question had some earlier answers, of which I shall single out the following three:f is recursive,f is computable on an abstract machine,f is definable in the untyped λ-calculus.These tentative answers were shown to be equivalent by Church [1936] and Turing [1936–7].I shall discuss here some of the more recent developments of these notions of computability and their relevance to linguistics and logic. I hope to be forgiven for dwelling on some of the work I have been involved with personally, with greater emphasis than is justified by its historical significance. (shrink)

In classical logic, a contradiction allows one to derive every other sentence of the underlying language; paraconsistent logics came relatively recently to subvert this explosive principle, by allowing for the subsistence of contradictory yet non-trivial theories. Therefore our surprise to find Wittgenstein, already at the 1930s, in comments and lectures delivered on the foundations of mathematics, as well as in other writings, counseling a certain tolerance on what concerns the presence of contradictions in a mathematical system. ‘Contradiction. Why just this (...) spectre? This is really very suspicious.’ ( Philosophical Remarks III–56) In the last decades, several authors (e.g. Arrington, Hintikka, Van Heijenoort, Wright, Wrigley) have been digging into Wittgenstein’s rather non-standard standpoint on what concerns the interpretation and import of contradiction in logic and mathematics, and many other authors (e.g. da Costa, Goldstein, Granger, Marconi) have been investigating the possibility of taking Wittgenstein seriously as one of the early forerunners of paraconsistency. While many advances have been made on the first front, the second set of investigations has led almost exclusively to negative results: no, no operational proposal about the construction of a logic in which (some) contradictions are made inoffensive can be read from Wittgenstein’s philosophical work; in fact, it appears that the most one can find there is the exhortation for mathematicians to alter their attitude with respect to contradictions and to consistency proofs. The play is done, and one looks for a resume of the opera. This paper fills that blank, as a thorough investigation of the possible relations between Wittgenstein and paraconsistency. DOI:10.5007/1808-1711.2010v14n1p135. (shrink)