The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...

The metamathematical theorems of Gödel and Church are frequently applied to the philosophy of mind, typically as rational evidence against mechanism. Using methods of Post and Smullyan, these results are presented as purely mathematical theorems and various such applications are discussed critically. In particular, J. Lucas's use of Gödel's theorem to distinguish between conscious and unconscious beings is refuted, while more generally, attempts to extract philosophy from metamathematics are shown to involve only dramatizations of the constructivity problem in foundations. More (...) specifically, philosophical extrapolations from metamathematics are shown to involve premature extensions of Church's thesis. (shrink)

In his doctor's thesis [1], Henkin has shown that if a formal logic is consistent, and sufficiently complex, then it must admit a non-standard model. In particular, he showed that there must be a model in which that portion of the model which is supposed to represent the positive integers of the formal logic is not in fact isomorphic to the positive integers; indeed it is not even well ordered by what is supposed to be the relation of ≦.For the (...) purposes of the present paper, we do not need a precise definition of what is meant by a standard model of a formal logic. The non-standard models which we shall discuss will be flagrantly non-standard, as for instance a model of the sort whose existence is proved by Henkin. It will suffice if we and our readers are in agreement that a model of a formal logic is not a standard model if either: The relation in the model which represents the equality relation in the formal logic is not the equality relation for objects of the model. That portion of the model which is supposed to represent the positive integers of the formal logic is not well ordered by the relation ≦. That portion of the model which is supposed to represent the ordinal numbers of the formal logic is not well ordered by the relation ≦. (shrink)

We have seen that despite Feferman's results Gödel's second theorem vitiates the use of Hilbert-type epistemological programs and consistency proofs as a response to mathematical skepticism. Thus consistency proofs fail to have the philosophical significance often attributed to them.This does not mean that consistency proofs are of no interest to philosophers. We know that a ‘non-pathological’ consistency proof for a system S will use methods which are not available in S. When S is as strong a system as we are (...) willing to entertain seriously then a consistency proof for it will yield no epistemological gain. But in other cases philosophers might argue that the proof uses methods which are merely different rather than stronger than those available in the system in question. This claim has been made, for example, in the case of the constructive consistency proofs for elementary number theory. Similar philosophical investigations can be made on relative consistency proofs, since these differ from each other in the principles they employ. For example, most relative consistency proofs can be carried out within elementary number theory, but without using the theory of real numbers, no one has been able to prove the consistency of Quine's ML relative to that of his NF.What about the consistency of all mathematics or of some strong system for set theory? How do we answer the skeptic? Since here a convincing proof is not possible, we have established that the skeptic demands too much. We cannot be certain that our axioms are free from contradiction and must treat them as hypotheses which may be abandoned or modified in the face of further mathematical experience. This attitude is taken by many foundational workers who also go on to voice opinions about thelikelihood that various systems are consistent. Since these opinions are variously supported by appeals to the clarity of the mathematical concept formalized, the existence or non-existence of ‘weird’ models for the system and actual empirical experience with the system, this is surely a fruitful area for philosophical research. (shrink)

This essay re-examines Meinong's "Über Gegenstandstheorie" and undertakes a clarification and revision of it that is faithful to Meinong, overcomes the various objections to his theory, and is capable of offering solutions to various problems in philosophy of mind and philosophy of language. I then turn to a discussion of a historically and technically interesting Russell-style paradox (now known as "Clark's Paradox") that arises in the modified theory. I also examine the alternative Meinong-inspired theories of Hector-Neri Castañeda and Terence Parsons.

This is an extensively revised edition of Mr. Quine's introduction to abstract set theory and to various axiomatic systematizations of the subject.

This book, one of the first full-length studies of the modalities to emerge from the debate to which Saul Kripke, David Lewis, Ruth Marcus, and others are contributing, is an exploration and defense of the notion of modality de re, the idea that objects have both essential and accidental properties. Plantinga develops his argument by means of the notion of possible worlds and ranges over such key problems as the nature of essence, transworld identity, negative existential propositions, and the existence (...) of unactual objects in other possible worlds. He also applies his logical theories to the elucidation of two problems in the philosophy of religion: the problem of evil and the ontological argument. (shrink)

In this book Terence Parsons revives the older tradition of taking such objects at face value. Using various modern techniques from logic and the philosophy of language, he formulates a metaphysical theory of nonexistent objects. The theory is given a formalization in symbolism rich enough to contain definite descriptions, modal operators, and epistemic contexts, and the book includes a discussion which relates the formalized theory explicitly to English.

In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machines - by means of Incompleteness Theorem of Gödel. Gödel’s theorem shows that in any system consistent and adequate for simple arithmetic there are formulae which cannot be proved in the system but that human minds can recognize as true; Lucas points out in his turn that Gödel’s theorem applies to machines because a machine is the concrete instantiation of a formal system: therefore, for (...) every machine consistent and able of doing simple arithmetic, there is a formula that it can’t produce as true but that we can see to be true, and so human minds and machines have to be different. Lucas considers as well in this article some possible objections to his argument: for any Gödelian formula we could, for instance, construct a machine able to produce it or we could put the Gödelian formulae that we had proved as axioms of a further machine. However - as Lucas underlines - for every of such machines we could again formulate another Gödelian formula, the Gödelian formula of these machines, that they are not able to proof but that we can recognize as true. More general arguments, such as the possibility to escape Gödelian argument by suggesting that Gödel’s theorem applies to consistent systems while we could be inconsistent ones, are moreover refuted by Lucas by maintaining that our inconsistency corresponds to occasional malfunctioning of a machine and not to his normal inconsistency; indeed, a inconsistent machine is characterized by producing any statement, on the contrary human being are selective and not disposed to assert anything. (shrink)

A young scientist and mathematician explores the mystery and complexity of human thought processes from an interdisciplinary point of view.

In recent years much effort has gone into the study of languages which strengthen the classical first-order predicate calculus in various ways. This effort has been motivated by the desire to find a language which is(I) strong enough to express interesting properties not expressible by the classical language, but(II) still simple enough to yield interesting general results. Languages investigated include second-order logic, weak second-order logic, ω-logic, languages with generalized quantifiers, and infinitary logic.

Variations on the ontological argument for most minimal and most mediocre beings.