## Advanced Theory of the Logical Design of Digital Computers |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The logic of classes | 1 |

Boolean algebra in switching networks | 9 |

Manipulative techniques of Boolean algebra | 18 |

10 other sections not shown

### Common terms and phrases

algebra algorithm Alonzo Church assignment asynchronous asynchronous circuits automata automaton basis rows behavior Boolean Boolean algebra bounded quantifiers carry leads carry-variables cell assemblies clauses column conjunction conjunctive normal form connection matrix contact network contains corresponding cycle decision problem defined determined diagram digits disjunction disjunctive normal form electronic entries example expression finite flow table given Hence implies input sequence input-carry iterative network k-tuples logical machine method negation neuron node normal formula obtained OOOOOOOOOOO OOOOOOOOOOO operation output table output-carry possible pqfs predicates prime implicants procedure propositional calculus pulse quantifiers R-sequences realized recursion equivalences reduced regular expression replaced represent result sequential circuits shown in Figure signals simplest normal equivalent switch tube switching circuits switching elements switching function symbol synapses synthesis problem synthesis requirement tape terminal Theorem theory tion toggle transmission TRUTH FUNCTIONS vertex voltage zero