Switching theory : insight through predicate logic
Author(s)
Bibliographic Information
Switching theory : insight through predicate logic
(Engineering online library)
Springer, c2004
- : softcover
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [411]-413) and index
"Originally published by Springer-Verlag Berlin Heidelberg New York in 2004" -- T.p. verso
"Softcover reprint of the hardcover 1st edition 2004" -- T.p. verso
"With 323 figures" -- T.p.
Description and Table of Contents
Description
This new approach to an established field introduces the concept of predicate logic in order to supersede propositional logic in switching theory. The author gives new insight into the theory of latches (memory circuits) for use in undergraduate and graduate courses.
Table of Contents
Division One Fundamental Concepts.- 1 Outline and Basics.- 2 Switching Devices.- 3 Functions.- 4 Logic Functions and Gates.- 5 Synthesis and Duality.- 6 Karnaugh Maps.- 7 Utilising Karnaugh Maps.- Division Two Logic.- 8 Tautologies.- 9 Propositional Logic.- 10 Summary of Theorems.- 11 Algebraic Proofs.- 12 On Predicate Logic.- 13 Predicate Logic.- Division Three Combinational Circuits.- 14 Canonical Normal Forms.- 15 Shegalkin Normal Form.- 16 Synthesis Examples.- 17 Concepts Old and New.- 18 Minimisation Preliminaries.- 19 Minimisation-an Excerp.- 20 Reduced Karnaugh Maps.- 21 NOT-AND and NOT-OR.- 22 Composition of Circuits.- 23 Hazards.- Division Four Latches.- 24 Memorising by Feedback.- 25 Basic Theory of Latches.- 26 Optimised Latches.- 27 Elementary Latches.- 28 Composition of Latches.- Division Five Sequential Circuits with Continuously Read Inputs.- 29 Automata and Programs.- 30 Word-Recognition Tables.- 31 Catenation Model.- 32 Toggle Circuits.- 33 Triggering and Synchronising.- 34 Verifying a Logic Design.- 35 Discussing Huffman's Theory.- 36 State Encoding Techniques.
by "Nielsen BookData"