Mathematical logic and computability

Bibliographic Information

Mathematical logic and computability

H. Jerome Keisler, Joel Robbin

(International series in pure and applied mathematics)(McGraw-Hill international editions, . Mathematics & statistics series)

McGraw-Hill, 1996

International eds.

Available at  / 5 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 text requires some prior knowledge of mathematical proof. The authors emphasize proof theory of computation rather than set theory. A disk, featuring examples, is also available.

Table of Contents

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

by "Nielsen BookData"

Related Books: 1-2 of 2

Details

  • NCID
    BA34692565
  • ISBN
    • 0071144269
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    New York ; Tokyo
  • Pages/Volumes
    vii, 484 p
  • Size
    23 cm
  • Attached Material
    1 floppy disk
  • Classification
  • Parent Bibliography ID
Page Top