Mathematical logic and computability

Bibliographic Information

Mathematical logic and computability

H. Jerome Keisler, Joel Robbin ; contributors, Arnold Miller ... [et al.]

(International series in pure and applied mathematics)

McGraw-Hill, c1996

Available at  / 1 libraries

Search this Book/Journal

Note

Bibliography: p. 479

Includes index

Description and Table of Contents

Description

Intended for a one-semester advanced undergraduate course in mathematical logic, this book requires some prior knowledge of mathematical proof. The authors emphasize proof theory of computation rather than set theory. A disk, featuring numerous examples, is also available (ISBN: 0-07-840027-9).

Table of Contents

  • Propositional logic
  • pure predicate logic
  • full predicate logic
  • computable functions
  • the incompleteness theorems.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA47824396
  • ISBN
    • 0070339392
  • LCCN
    95080649
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    New York
  • Pages/Volumes
    vii, 484 p.
  • Size
    25 cm.
  • Attached Material
    1 floppy disk (3 1/2 in.)
  • Classification
  • Parent Bibliography ID
Page Top