Equally surprisingly, Descartes’s paranoid belief was shared by several contemporary mathematicians, among them Isaac Barrow, John Wallis and Edmund Halley. (Huxley 1959, pp. 354-355.) In the light of our fuller knowledge of history it is easy to smile at Descartes. It has even been argued by Netz that analysis was in fact for ancient Greek geometers a method of presenting their results (see Netz 2000). But in a deeper sense Descartes perceived something interesting in the historical record. We are looking (...) in vain in the writings of Greek mathematicians for a full explanation of what this famous method was. And I will argue for an answer to the question why this lacuna is there: Not because Greek geometers wanted to hide this method, but because they did not fully understand it. It is instructive to note the ambivalent attitude of the most rigorous mathematician of the period, Isaac Newton, to the method of analysis. He used it himself in his own mathematical work and in the expositions of that work. Yet when the mathematical push came to physical and cosmological shove, he formulated his Principia entirely in.. (shrink)

This papers presents δ-resolution, a dual resolution calculus. It is based on standard resolution, and used appropriate formulae equivalent to disjunctive normal forms, instead of conjunctive normal ones, as it is the case for resolution. This duality is then useful to create a calculus for abductive process, as a way to construct a set of abductive solutions. The proposed calculus is compared to semantic tableaux, an standard logical framework, aslo illuminating when studying abduction.δ-resolution calculus is a contribution to logic programming, (...) and it further suggests new possibilities to explore abduction at a first order level, in the lines of those proposed in [9]. (shrink)

This dissertation examines several of the problems that Hilbert discovered in the foundations of mathematics, from a metalogical perspective. The problems manifest themselves in four different aspects of Hilbert’s views: (i) Hilbert’s axiomatic approach to the foundations of mathematics; (ii) His response to criticisms of set theory; (iii) His response to intuitionist criticisms of classical mathematics; (iv) Hilbert’s contribution to the specification of the role of logical inference in mathematical reasoning. This dissertation argues that Hilbert’s axiomatic approach was guided primarily (...) by model theoretical concerns. Accordingly, the ultimate aim of his consistency program was to prove the model-theoretical consistency of mathematical theories. It turns out that for the purpose of carrying out such consistency proofs, a suitable modification of the ordinary first-order logic is needed. To effect this modification, independence-friendly logic is needed as the appropriate conceptual framework. It is then shown how the model theoretical consistency of arithmetic can be proved by using IF logic as its basic logic. Hilbert’s other problems, manifesting themselves as aspects (ii), (iii), and (iv)—most notably the problem of the status of the axiom of choice, the problem of the role of the law of excluded middle, and the problem of giving an elementary account of quantification—can likewise be approached by using the resources of IF logic. It is shown that by means of IF logic one can carry out Hilbertian solutions to all these problems. The two major results concerning aspects (ii), (iii) and (iv) are the following: (a) The axiom of choice is a logical principle; (b) The law of excluded middle divides metamathematical methods into elementary and non-elementary ones. It is argued that these results show that IF logic helps to vindicate Hilbert’s nominalist philosophy of mathematics. On the basis of an elementary approach to logic, which enriches the expressive resources of ordinary first-order logic, this dissertation shows how the different problems that Hilbert discovered in the foundations of mathematics can be solved. (shrink)

A complete, subformula-preserving proof system for goal-driven reasoning in first-order logic is presented. The proof system is a transition system and its proofs are (linear and local) computations in the transistion system. Thus the proof system fits into a standard framework for modeling problem-solving in cognitive psychology.

A translation of the Écrits logiques, edited by Jean Van Heijenoort, published in 1968.

We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.