To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For over a century now there has been a continuing debate about whether the forms of explanation appropriate to the social sciences are essentially the same as or radically different from those used in the natural sciences. On one side is the empiricist philosophical tradition, ranging at least from John Stuart Mill through the logical positivists. According to this view, the covering law model of explanation appropriate for the natural sciences is equally appropriate for subjects such as history, anthropology, linguistics, economics, and other social sciences.Onthe other side is the interpretivist or hermeneutic tradition which ranges at least from Dilthey in the nineteenth century through the twentieth-century followers of Wittgenstein. According to this tradition, there are special modes of explanation appropriate to human behavior. In the second tradition, for example, Dilthey claims that a special method which he calls Verstehen (literally, understanding) is essential to the social sciences. And more recently, Charles Taylor (1985) claimed that human beings are unique in that events are meaningful to them in a special way and that any mode of explanation adequate to accounting for human behavior must explain this meaning component.
An unstated but underlying feature of this debate is often the assumption that much larger issues are at stake. There is at least the suggestion that the issue is a version of the dispute between materialism, on one hand, and dualism and idealism, on the other.
What sorts of systematic explanations should we and can we seek in cognitive science for perception, language comprehension, rational action and other forms of cognition? In broad outline I think the answer is reasonably clear:We are looking for causal explanations, and our subject matter is certain functions of a biological organ, the human and animal brain.
As with any other natural science there are certain assumptions we have to make and certain conditions that our explanations have to meet. Specifically, we have to suppose that there exists a reality totally independent of our representations of it (in a healthier intellectual era it would not be necessary to say that), and we have to suppose that the elements of that reality that we cite in our explanations genuinely function causally.
Not all functions of the brain are relevant to cognition, so we have to be careful to restrict the range of brain functions we are discussing. Cognitive science is about the cognitive functioning of the brain and its relation to the rest of the organism and to the rest of the world in the way that nutrition science is about the digestive functioning of the digestive system and its relation to the rest of the organism and the rest of the world. Like other organs, and indeed like other physical systems, the brain has different levels of description and cognitive science is appropriately concerned with any level of description of the brain that is relevant to the causal explanation of cognition.
The notion of a performative is one that philosophers and linguists are so comfortable with that one gets the impression that somebody must have a satisfactory theory. But I have not seen such a theory and in this essay I want to address the question: how exactly do performatives work? I believe that answering that question is not just a fussy exercise in linguistic analysis but can give us insights into the nature of language and the relation between speech acts and actions generally. Some people who have written about performatives seem to think that it is just a semantic fact about certain verbs that they have performative occurrences, but the puzzle is: how could any verbs have such remarkable properties just as a matter of semantics? I can't fix the roof by saying, “I fix the roof” and I can't fry an egg by saying, “I fry an egg,” but I can promise to come and see you just by saying, “I promise to come and see you” and I can order you to leave the room just by saying, “I order you to leave the room.” Now why the one and not the other? And, to repeat, how exactly does it work? Perhaps the most widely accepted current view is the following: performative utterances are really just statements with truth values like any other statements, and Austin was wrong to contrast performative utterances with some other kind. The only special feature of the performative statement is that the speaker can perform some other speech act indirectly by making the statement.
In the preceding chapter we introduced the classes of primitive recursive and recursive functions. In this chapter we introduce the related notions of primitive recursive and recursive sets and relations, which help provide many more examples of primitive recursive and recursive functions. The basic notions are developed in section 7.1. Section 7.2 introduces the related notion of a semirecursive set or relation. The optional section 7.3 presents examples of recursive total functions that are not primitive recursive.
Recursive Relations
A set of, say, natural numbers is effectively decidable if there is an effective procedure that, applied to a natural number, in a finite amount of time gives the correct answer to the question whether it belongs to the set. Thus, representing the answer ‘yes’ by 1 and the answer ‘no’ by 0, a set is effectively decidable if and only if its characteristic function is effectively computable, where the characteristic function is the function that takes the value 1 for numbers in the set, and the value 0 for numbers not in the set. A set is called recursively decidable, or simply recursive for short, if its characteristic function is recursive, and is called primitive recursive if its characteristic function is primitive recursive. Since recursive functions are effectively computable, recursive sets are effectively decidable. Church's thesis, according to which all effectively computable functions are recursive, implies that all effectively decidable sets are recursive.
A model of a set of sentences is any interpretation in which all sentences in the set are true. Section 12.1 discusses the sizes of the models a set of sentences may have (where by the size of a model is meant the size of its domain) and the number of models of a given size a set of sentences may have, introducing in the latter connection the important notion of isomorphism. Section 12.2 is devoted to examples illustrating the theory, with most pertaining to the important notion of an equivalence relation. Section 12.3 includes the statement of two major theorems about models, the Löwenheim—Skolem (transfer) theorem and the (Tarski—Maltsev) compactness theorem, and begins to illustrate some of their implications. The proof of the compactness theorem will be postponed until the next chapter. The Löwenheim—Skolem theorem is a corollary of compactness (though it also admits of an independent proof, to be presented in a later chapter, along with some remarks on implications of the theorem that have sometimes been thought ‘paradoxical’).
The Size and Number of Models
By a model of a sentence or set of sentences we mean an interpretation in which the sentence, or every sentence in the set, comes out true. Thus Γ implies D if every model of Γ is a model of D, D is valid if every interpretation is a model of D, and Γ is unsatisfiable if no interpretation is a model of Γ.
A normal form theorem of the most basic type tells us that for every formula A there is a formula A* of some special syntactic form such that A and A* are logically equivalent. A normal form theorem for satisfiability tells us that for every set Γ of sentences there is a set Γ* of sentences of some special syntactic form such that Γ and Γ* are equivalent for satisfiability, meaning that one will be satisfiable if and only if the other is. In section 19.1 we establish the prenex normal form theorem, according to which every formula is logically equivalent to one with all quantifiers at the beginning, along with some related results. In section 19.2 we establish the Skolem normal form theorem, according to which every set of sentences is equivalent for satisfiability to a set of sentences with all quantifiers at the beginning and all quantifiers universal. We then use this result to give an alternative proof of the Löwenheim—Skolem theorem, which we follow with some remarks on implications of the theorem that have sometimes been thought ‘paradoxical’. In the optional section 19.3 we go on to sketch alternative proofs of the compactness and Gödel completeness theorems, using the Skolem normal form theorem and an auxiliary result known as Herbrand's theorem. In section 19.4 we establish that every set of sentences is equivalent for satisfiability to a set of sentences not containing identity, constants, or function symbols. Section 19.1 presupposes only Chapters 9 and 10, while the rest of the chapter presupposes also Chapter 12. […]
In the preceding chapter we connected our work on recursion with our work on formulas and proofs in one way, by showing that various functions associated with formulas and proofs are recursive. In this chapter we connect the two topics in the opposite way, by showing how we can ‘talk about’ recursive functions using formulas, and prove things about them in theories formulated in the language of arithmetic. In section 16.1 we show that for any recursive function f, we can find a formula φf such that for any natural numbers a and b, if f(a) = b then ∀y(φf(a, y) ↔ y = b) will be true in the standard interpretation of the language of arithmetic. In section 16.1 we strengthen this result, by introducing a theory Q of minimal arithmetic, and showing that for any recursive function f, we can find a formula ψf such that for any natural numbers a and b, if f (a) = b then ∀y(ψf (a, y) ↔ y = b) will be not merely true, but provable in Q. In section 16.2 we briefly introduce a stronger theory P of Peano arithmetics, which includes axioms of mathematical induction, and explain how these axioms enable us to prove results not obtainable in Q. The brief, optional section 16.3 is an appendix for readers interested in comparing our treatment of these matters here with other treatments in the literature.
By a model of (true) arithmetic is meant any model of the set of all sentences of the language L of arithmetic that are true in the standard interpretation N. By a nonstandard model is meant one that is not isomorphic to N. The proof of the existence of an (enumerable) nonstandard model of arithmetic is as an easy application of the compactness theorem (and the Löwenheim—Skolem theorem). Every enumerable nonstandard model is isomorphic to a nonstandard model ℳ whose domain is the same as that of N, namely, the set of natural numbers; though of course such an ℳ cannot assign the same denotations as N to the nonlogical symbols of L. In section 25.1 we analyze the structure of the order relation in such a nonstandard model. A consequence of this analysis is that, though the order relation cannot be the standard one, it at least can be a recursive relation. By contrast, Tennenbaum's theorem tells us that it cannot happen that the addition and multiplication relations are recursive. This theorem and related results will be taken up in section 25.2. Section 25.3 is a sort of appendix (independent of the other sections, but alluding to results from several earlier chapters) concerning nonstandard models of an expansion of arithmetic called analysis.
Order in Nonstandard Models
Let ℳ be a model of (true) arithmetic not isomorphic to the standard model N.
The original authors of this work, the late George Boolos and my late colleague Richard Jeffrey, stated in the preface to the first edition that the work was intended for students of philosophy, mathematics, and other fields who desired a more advanced knowledge of logic than is supplied by an introductory course or textbook on the subject, and added the following:
The aim has been to present the principal fundamental theoretical results about logic, and to cover certain other meta-logical results whose proofs are not easily obtainable elsewhere. We have tried to make the exposition as readable as was compatible with the presentation of complete proofs, to use the most elegant proofs we knew of, to employ standard notation, and to reduce hair (as it is technically known).
Such have remained the aims of all subsequent editions, including the present one.
The ‘principal fundamental theoretical results about logic’ are primarily the theorems of Gödel—the completeness theorem and especially the incompleteness theorems—with their attendant lemmas and corollaries. The ‘other meta-logical results’ included have been of two kinds. On the one hand, filling roughly the first third of the book, there is an extended exposition by R.C.J. of the theory of Turing machines, a topic frequently alluded to in the literature of philosophy, computer science, and cognitive studies, but often omitted in textbooks on the level of this one.