Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

This essay presents a philosophical and computational theory of the representation of de re, de dicto, nested, and quasi-indexical belief reports expressed in natural language. The propositional Semantic Network Processing System (SNePS) is used for representing and reasoning about these reports. In particular, quasi-indicators (indexical expressions occurring in intentional contexts and representing uses of indicators by another speaker) pose problems for natural-language representation and reasoning systems, because--unlike pure indicators--they cannot be replaced by coreferential NPs without changing the meaning of the (...) embedding sentence. Therefore, the referent of the quasi-indicator must be represented in such a way that no invalid coreferential claims are entailed. The importance of quasi-indicators is discussed, and it is shown that all four of the above categories of belief reports can be handled by a single representational technique using belief spaces containing intensional entities. Inference rules and belief-revision techniques for the system are also examined. (shrink)

An integrated statement is made concerning the semantic status of nodes in a propositional semantic network, claiming that such nodes represent only intensions. Within the network, the only reference to extensionality is via a mechanism to assert that two intensions have the same extension in same world. This framework is employed in three application problems to illustrate the nature of its solutions.The formalism used here utilizes only assertional information and no structural, or definitional, information. This restriction corresponds to many of (...) the psychologically motivated network models. Some of the psychological implications of network processes called node merging and node splitting are discussed. Additionally, it is pointed out that both our networks and the psychologically based networks are prone to memory confusions about knowing unless augmented by domain‐specific inference processes, or by structural information. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

Within AI and the cognitively related disciplines, there exist a multiplicity of uses of belief. On the face of it, these differing uses reflect differing views about the nature of an objective phenomenon called belief. In this paper I distinguish six distinct ways in which belief is used in AI. I shall argue that not all these uses reflect a difference of opinion about an objective feature of reality. Rather, in some cases, the differing uses reflect differing concerns with special (...) AI applications. In other cases, however, genuine differences exist about the nature of what we pre-theoretically call belief. To an extent the multiplicity of opinions about, and uses of belief, echoes the discrepant motivations of AI researchers. The relevance of this discussion for cognitive scientists and philosophers arises from the fact that (a) many regard theoretical research within AI as a branch of cognitive science, and (b) even if theoretical AI is not cognitive science, trends within AI influence theories developed within cognitive science. It should be beneficial, therefore, to unravel the distinct uses and motivations surrounding belief, in order to discover which usages merely reflect differing pragmatic concerns, and which usages genuinely reflect divergent views about reality. (shrink)

A process-oriented model of belief is presented which permits the representation of nested propositional attitudes within first-order logic. The model (NIM, for nested intensional model) is axiomatized, sense-based (via intensions), and sanctions inferences involving nested epistemic attitudes, with different agents and different times. Because NIM is grounded upon senses, it provides a framework in which agents may reason about the beliefs of another agent while remaining neutral with respect to the syntactic forms used to express the latter agent's beliefs. Moreover, (...) NIM provides agents with a conceptual map, interrelating the concepts of knowledge, belief, truth, and a number of cognate concepts, such as infers, retracts, and questions. The broad scope of NIM arises in part from the fact that its axioms are represented in a novel extension of first-order logic, -FOL (presented herein). -FOL simultaneously permits the representation of truth ascriptions, implicit self-reference, and arbitrarily embedded sentences within a first-order setting. Through the combined use of principles derived from Frege, Montague, and Kripke, together with context-sensitive semantic conventions, -FOL captures the logic of truth inferences, while avoiding the inconsistencies exhibited by Tarski. Applications of -FOL and NIM to interagent reasoning are described and the soundness and completeness of -FOL are established herein. (shrink)

The representation of propositional attitudes (beliefs, desires, etc.) and the analysis of natural-language, propositional-attitude reports presents difficult problems for cognitive science and artificial intelligence. In particular, various representational approaches to attitudes involve the incorrect “imputation,” to cognitive agents, of the use of artificial theory-laden notions. Interesting cases of this problem are shown to occur in several approaches to attitudes. The imputation problem is shown to arise from the way that representational approaches explicate properties and relationships, and in particular from the (...) way they explicate propositional attitudes themselves. Another factor contributing to imputation is the compositional nature of typical semantic approaches to propositional-attitude reports. Some strategies for avoiding undesirable imputation are examined. One of the main conclusions is that the importance of imputations that arise in a representation scheme depends strongly on the use to which the scheme is put -- on whether, for instance, the scheme is used as part of a formal, objective account of natural language, or is used rather as a representational tool within an agent. (shrink)

The papers collected in this volume were written over a period of some eight or nine years, with some still earlier material incorporated in one of them. Publishing them under the same cover does not make a con tinuous book of them. The papers are thematically connected with each other, however, in a way which has led me to think that they can naturally be grouped together. In any list of philosophically important concepts, those falling within the range of application (...) of modal logic will rank high in interest. They include necessity, possibility, obligation, permission, knowledge, belief, perception, memory, hoping, and striving, to mention just a few of the more obvious ones. When a satisfactory semantics (in the sense of Tarski and Carnap) was first developed for modal logic, a fascinating new set of methods and ideas was thus made available for philosophical studies. The pioneers of this model theory of modality include prominently Stig Kanger and Saul Kripke. Several others were working in the same area independently and more or less concurrently. Some of the older papers in this collection, especially 'Quantification and Modality' and 'Modes of Modality', serve to clarify some of the main possibilities in the semantics of modal logics in general. (shrink)

An introduction to the various logics of truth and modality as part of a foundation for the construction of theories of knowledge representation. The book reviews various semantic theories and employs them as the basis for the development of logics of truth and modality.

Expressions in a language, whether words, phrases, or sentences, have meanings. So it seems reasonable to suppose that there are meanings that expressions have. Of course, it is fashionable in some philosophical circles to deny this.