No label defined (Q3709841)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3938516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3938516 |
Statements
1985
0 references
higher order logic
0 references
logic programming
0 references
intensiontal logic
0 references
Symbolic Logic
0 references
Propositional Logic
0 references
Predicate Logic
0 references
Montague Grammars
0 references
resolution principle
0 references
PROLOG
0 references
modal logic
0 references
categorical grammar
0 references
0 references
0 references
0 references
This is the seventh of 24 volumes that comprise the Iwanami Series in Computer Science. (The Series is intended to give a comprehensive view of computer science for graduate and undergraduate students). The seven chapters of the book are: I. Symbolic Logic, II. Propositional Logic, III. Predicate Logic, IV. Model Theory of Predicate Logic, V. Predicate Logic and Programming, VI. Modality and Intensionality, and VII. Initiation to Montague Grammars. In the first three chapters, the authors treat the standard topic from the computer scientists' point of view. So, many examples are given here (as well as throughout the book), a Gentzen system and the Davis-Putnam algorithm are presented. On the other hand, the Gödel completeness and the incompleteness of any recursive axiomatic system are just mentioned, and not proved. In this book, the notion of recursion is not touched upon at all, e.g. Turing machines, recursive sets, the decidability of a first order theory are not mentioned. The fourth chapter is about the resolution principle of J. A. Robinson. The justification of this principle is based on Skolem functions and Herbrand universes, and so 'model theory' in the title is not a complete misfit, but certainly it does not mean '03Cxx'. Various techniques to increase efficiency, like semantic resolution, are explained. The theme of chapter V is PROLOG (and so Horn formulas). Not by the formal definition, but by examples, the authors illustrate the fundamental ideas of PROLOG. Examples shown include computation of exponentiation and sorting. The last example is a syntactical analysis of 'John loves Mary'; and that of 'John-wa Mary-wo aisuru' is left as an exercise. \(\{\) Is the reviewer alone in wondering if 'John loves Mary' shouldn't be relegated to an exercise in a Japanese book?\(\}\) The connection with Hoare's programming constructs is also explained. The sixth chapter is a preparation for the next one, so to speak. Modal, intensional, and higher order logics are explained, and some of their connection with computer science are pointed out. The accessibility relation is introduced in the context of modality, but Kripke semantics and forcing are not. At the end of the chapter, the authors exhibit two related formal systems, IL and \(ML_ T\), together with their models. IL is R. Mongague's Intensional [type theoretic] Logic [with \(\lambda\)- conversion], and \(ML_ T\) is a modal logic. The last chapter is an exposition of \textit{R. Montague}'s ''The Proper Treatment of Quantification in Ordinary English'' [Hintikka, et al. eds., ''Approaches to Natural Language'', 221-242 (1973)]. The idea of categorical grammar is explained with charts and examples, and so is the translation into IL. To give the semantics [meanings] to English, Montague made this translation so as to make connection with the material of the previous chapter. 'De dicto' versus 'de re' versions and 'the meaning postulates' are explained through various examples, including 'John believes that a fish walks' and 'John finds a unicorn'. There are a number of typographical errors, which are not too bad. But there are some ambiguous passages in the text. For instance, in B2 on p.60, the restriction on the eigen variable is not stated. And, Ex. 3.5 on p.61 gives the impression that this restriction is not required, while in the proof of the Deduction Theorem on p.62, the restriction is explicitly used. In the middle of p.78, \(F_ 1\) and \(F_ 2\) should be interchanged. All in all, this is a very handy book: within 200 pages, many topics, some of which are of recent origin, are presented very clearly.
0 references