Mathematical Logic For Computer Science (2nd Edition)
2nd Edition
Published on 24. August 1998
Book
Hardback
256 pages
978-981-02-3091-3 (ISBN)
Description
Mathematical logic is essentially related to computer science. This book describes the aspects of mathematical logic that are closely related to each other, including classical logic, constructive logic, and modal logic. This book is intended to attend to both the peculiarities of logical systems and the requirements of computer science.In this edition, the revisions essentially involve rewriting the proofs, increasing the explanations, and adopting new terms and notations.
More details
Series
Edition
2nd Revised edition
Language
English
Place of publication
Singapore
Singapore
Target group
College/higher education
Professional and scholarly
Edition type
Revised edition
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 19 mm
Weight
529 gr
ISBN-13
978-981-02-3091-3 (9789810230913)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Zhongwan Lu
Mathematical Logic For Computer Science
Book
07/1989
EPB Publishers Pte Ltd
€120.34
Available (delivery time upon request)
Person
Content
Part 1 Prerequisites: sets; inductive definitions and proofs; notations. Part 2 Classical propositional logic: propositions and connectives; propositional language; semantics; tautological consequence; formal deduction; disjunctive and conjunctive normal forms; adequate sets of connectives. Part 3 Classical first-order logic: proposition functions and quantifiers; first-order language; semantics; logical consequence; formal deduction; prenex normal form. Part 4 Axiomatic deduction system: axiomatic deduction system; relation between the two deduction systems. Part 5 Soundness and completeness: satisfiability and validity; soundness; completeness of propositional logic; completeness of first-order logic; completeness of first-order logic with equality; independence. Part 6 Compactness, Lowenheim-Skolem, and Herbrand theorems: compactness; Lowenheim-Skolem's theorem; Herbrand's theorem. Part 7 Constructive logic: constructivity of proofs; semantics; formal deduction; soundness; completeness. Part 8 Modal propositional logic: modal propositional language; semantics; formal deduction; soundness; completeness of T; completeness of S4, B, S5. Part 9 Modal first-order logic: modal first-order language; semantics; formal deduction; soundness; completeness; equality.