First-order logic and automated theorem proving / Melvin Fitting.
Material type:
TextSeries: Texts and monographs in computer sciencePublication details: New York : Springer-Verlag, c1990.Description: xiii, 242 p. : ill. ; 24 cmISBN: - 0387972331 (alk. paper)
- 005.131 23 F547
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 005.131 F547 (Browse shelf(Opens below)) | Available | C26370 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | |||||||
| 005.131 D787 Attribute grammar for the semantic analysis of Ada | 005.131 En57 Simple Program scheme and formal languages | 005.131 En57 Simple Program scheme and formal languages | 005.131 F547 First-order logic and automated theorem proving / | 005.131 G181 Temporal logics and their applications | 005.131 G493 Algebraic and automata theoretic properties of formal languages | 005.131 G662 Introduction to HOL |
Includes bibliographical references (p. [233]-236) and index.
1. Background--
2. Propositional logic--
3. Semantic tableaux and resolution--
4. Other propositional proof procedures--
5. First-order logic--
6. First-order proof procedures--
7. Implementing tableaux and resolution--
8. Equality--
References--
Index.
A mathematical monograph on first-order logic. Applications to automated theorem-proving are considered and Prolog programmes provided. May serve as a first text on formal logic for graduate students of computer science or mathematics.
There are no comments on this title.
