Switching theory: insight through predicate logic
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
2004
|
| Schriftenreihe: | Engineering online library
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 411 - 413 |
| Beschreibung: | 428 S. Ill., graph. Darst. |
| ISBN: | 3540403434 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV020820924 | ||
| 003 | DE-604 | ||
| 005 | 20060206 | ||
| 007 | t | ||
| 008 | 051006s2004 gw ad|| |||| 00||| eng d | ||
| 016 | 7 | |a 968585345 |2 DE-101 | |
| 020 | |a 3540403434 |c Pp. : EUR 106.95, sfr 155.00 |9 3-540-40343-4 | ||
| 035 | |a (OCoLC)52547706 | ||
| 035 | |a (DE-599)BVBBV020820924 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91 |a DE-521 | ||
| 050 | 0 | |a TK7868.S9V56 2003 | |
| 082 | 0 | |a 621.3815/372 22 | |
| 082 | 0 | |a 621.3815/372 |2 22 | |
| 084 | |a ST 195 |0 (DE-625)143608: |2 rvk | ||
| 084 | |a ZN 5620 |0 (DE-625)157469: |2 rvk | ||
| 084 | |a 27 |2 sdnb | ||
| 084 | |a ELT 450f |2 stub | ||
| 084 | |a 37 |2 sdnb | ||
| 084 | |a 28 |2 sdnb | ||
| 084 | |a DAT 195f |2 stub | ||
| 100 | 1 | |a Vingron, Shimon Peter |d 1936- |e Verfasser |0 (DE-588)125011407 |4 aut | |
| 245 | 1 | 0 | |a Switching theory |b insight through predicate logic |c Shimon P. Vingron |
| 264 | 1 | |a Berlin u.a. |b Springer |c 2004 | |
| 300 | |a 428 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Engineering online library | |
| 500 | |a Literaturverz. S. 411 - 413 | ||
| 650 | 4 | |a Switching theory | |
| 650 | 4 | |a Predicate (Logic) | |
| 650 | 0 | 7 | |a Logischer Entwurf |0 (DE-588)4168051-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prädikatenlogik |0 (DE-588)4046974-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Sequenzielle Logik |0 (DE-588)4323079-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Schaltalgebra |0 (DE-588)4179375-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Digitalschaltung |0 (DE-588)4012295-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Digitalschaltung |0 (DE-588)4012295-5 |D s |
| 689 | 0 | 1 | |a Logischer Entwurf |0 (DE-588)4168051-0 |D s |
| 689 | 0 | 2 | |a Schaltalgebra |0 (DE-588)4179375-4 |D s |
| 689 | 0 | 3 | |a Sequenzielle Logik |0 (DE-588)4323079-9 |D s |
| 689 | 0 | 4 | |a Prädikatenlogik |0 (DE-588)4046974-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013526296&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-013526296 | ||
Datensatz im Suchindex
| _version_ | 1804133774186774528 |
|---|---|
| adam_text | SHIMON P. VINGRON
SWITCHING THEORY
INSIGHT THROUGH PREDICATE LOGIC
WITH 323 FIGURES
SPRINGER
CONTENTS
DIVISION ONE FUNDAMENTAL CONCEPTS
1 OUTLINE AND BASICS 3
1.1 SPECIFYING A CIRCUIT IN PLAIN PROSE 3
1.2 DIAGRAM OF SUCCESSIVE EVENTS 4
1.3 TABLE OF ASSERTED EVENTS *^ 5
1.4 LOGIC VARIABLES AND LOGIC FORMULAS* 7
1.5 DRAWING THE CIRCUITS 9
1.6 SEQUENTIAL CIRCUITS * 10
1.7 VERIFYING A CIRCUIT * 12
2 SWITCHING DEVICES 14
2.1 PNEUMATIC VALVES 14
2.2 ELECTRIC RELAYS 18
2.3 CMOS TRANSISTOR CIRCUITS 23
3 FUNCTIONS 27
3.1 ORDERED PAIRS 27
3.2 SPEAKING OF FUNCTIONS... 31
3.3 SWITCHING FUNCTIONS 33
4 LOGIC FUNCTIONS AND GATES 36
4.1 ELEMENTARY SWITCHING FUNCTIONS 36
4.2 POSITIVE VERSUS NEGATIVE LOGIC * 37
4.3 ELEMENTARY LOGIC FUNCTIONS* 38
4.4 THE BASIC GATES * 40
4.5 DERIVED GATES * 43
5 SYNTHESIS AND DUALITY 46
5.1 MINTERM FUNCTIONS & MINTERMS * 46
5.2 MAXTERM FUNCTIONS & MAXTERMS * 49
5.3 SYNTHESIS VIA PARTIAL OUTPUTS* 50
5.4 DUALITY* 53
6 KARNAUGH MAPS 57
6.1 SPEAKING OF SETS... 57
6.2 INTRODUCING THE KARNAUGH MAP * 59
6.3 KARNAUGH MAPS FOR MULTIPLE INPUTS 62
6.4 KARNAUGH SETS * 64
* THOSE SECTIONS OR CHAPTERS MARKED BY AN ASTERISK (*) CONTAIN NEW
CONCEPTS,
PROOFS, OR METHODS.
7 UTILISING KARNAUGH MAPS 66
7.1 SPECIFYING SWITCHING CIRCUITS IN K-MAPS * 66
7.2 OBTAINING DISJUNCTIVE FORMULAS 67
7.3 OBTAINING CONJUNCTIVE FORMULAS * 68
7.4 LOGICALLY EQUIVALENT EXPRESSIONS * 70
7.5 LOGICAL IMPLICATIONS* 72
7.6 K-MAPS OF DUAL FUNCTIONS * 74
DIVISION TWO LOGIC
8 TAUTOLOGIES 79
8.1 LOGIC EXPRESSIONS 79
8.2 TRUTH TABLES 81
8.3 SPEAKING OF TAUTOLOGIES... 82
8.4 REPLACEMENT VERSUS SUBSTITUTION 85
8.5 LOGIC REASONING 86
9 PROPOSITIONAL LOGIC 89
9.1 AXIOMATIC APPROACH TO PROPOSITIONAL LOGIC 89
9.2 COMPLEMENTATION 91
9.3 IMPLICATION AND NEGATION 93
9.4 DEMORGAN S THEOREMS 94
9.5 COMMUTATIVITY OF AND AND OR 96
9.6 LOGIC IMPLICATIONS OF IMPLICATIONS 97
9.7 FORMULAS WITH A SINGLE VARIABLE 99
10 SUMMARY OF THEOREMS 101
10.1 COMMUTATIVE AND ASSOCIATIVE LAWS* 101
10.2 SINGLE-VARIABLE FORMULAS 103
10.3 DISTRIBUTIVE LAWS * 104
10.4 GENERALISED DEMORGAN THEOREMS 106
10.5 BASIC THEOREMS ON AND, OR AND NOT 109
11 ALGEBRAIC PROOFS NO
11.1 MIN- AND MAXTERMS ARE COMPLEMENTARY* 110
11.2 DISJUNCTION OF ALL MINTERMS * 111
11.3 CONJUNCTION OF TWO MINTERMMS * 113
11.4 MAXTERM AS THE DISJUNCTION OF MINTERMS * 114
11.5 MINTERM AND/OR MAXTERM * 115
11.6 SOLVING A SYSTEM OF LOGIC EQUATIONS * 117
11.7 DEMORGAN ON DEMORGAN 118
12 ON PREDICATE LOGIC 121
12.1 INSIDE A PROPOSITION 121
12.2 SYMBOLIC NOTATION OF PROPOSITIONS 122
12.3 THE SWITCHING ALGEBRA CONNECTION* 124
12.4 QUANTIFIERS 124
12.5 QUANTIFICATION AND REPLICATION * 126
12.6 FREE AND BOUND VARIABLES 126
13 PREDICATE LOGIC 129
13.1 AXIOMS AND RULES OF SWITCHING ALGEBRA* 129
13.2 THEOREMS ON IDENTITY 132
13.3 THEOREMS ON QUANTIFICATION 135
DIVISION THREE COMBINATIONAL CIRCUITS
14 CANONICAL NORMAL FORMS 141
14.1 AN OVERVIEW 141
14.2 DIRECT DERIVATION OF NORMAL FORMS * 144
14.3 SHANNON S EXPANSION THEOREMS* 147
14.4 SHANNON S EXPANSION TO NORMAL FORMS 149
15 SHEGALKIN NORMAL FORM 151
15.1 AN OVERVIEW 151
15.2 DEVELOPING THE SHEGALKIN POLYNOMIAL * 153
15.3 SHEGALKIN COEFFICIENTS 155
15.4 ON COMBINATIONS OF INPUT VARIABLES 156
15.5 DUAL SHEGALKIN POLYNOMIAL 157
15.6 NECESSARY AND SUFFICIENT CONNECTIVES 160
16 SYNTHESIS EXAMPLES 162
16.1 MULTIPLEXERS AND DEMULTIPLEXERS 162
16.2 BINARY CODED DECIMAL DIGITS 163
16.3 PRIORITY DECODERS 165
16.4 COMPARATORS 166
17 CONCEPTS OLD AND NEW 171
17.1 MULTIPLE EVENTS* 171
17.2 KARNAUGH SETS REVISITED* 172
17.3 GENERALISED MINTERMS* 173
17.4 GENERALISED MAXTERMS* 175
17.5 PARTITIONS AND EQUIVALENTS 176
17.6 PRIME SETS 177
17.7 COVERS 177
17.8 INCLUSIONS AND EXCLUSIONS* 179
17.9 EVALUATION FORMULAS* 180
18 MINIMISATION PRELIMINARIES 182
18.1 ASPECTS OF MINIMISATION 182
18.2 INCOMPLETE SPECIFICATION 183
18.3 PRIME SETS THAT COVER DON T CARES 185
18.4 EVALUATION FORMULAS FOR DON T CARES* 188
18.5 MINIMISATION BY K-MAPS 189
18.6 ALGEBRAIC MINIMISATION 190
19 MINIMISATION*AN EXCERP 193
19.1 ON ADJACENT K-SETS AND THEIR CONSENSUS* 193
19.2 FORMALISING ADJACENCY AND CONSENSUS 195
19.3 FINDING THE FULL COVER * 198
19.4 FINDING MINIMAL COVERS * 201
19.5 MINIMISATION CONSIDERING DON T CARES* 204
20 REDUCED KARNAUGH MAPS 207
20.1 REDUCING THE DIMENSION OF A K-MAP 207
20.2 K-MAPS WITHIN K-MAPS* 209
20.3 EVALUATING REDUCED K-MAPS* 211
20.4 SPECIFICATION BY MAP-ENTERED VARIABLES* 215
21 NOT-AND AND NOT-OR 219
21.1 MISCELLANEOUS THEOREMS 219
21.2 TWO-LEVEL CIRCUITS 221
21.3 MULTILEVEL NOT-AND CIRCUITS 222
21.4 MULTILEVEL NOT-OR CIRCUITS 228
22 COMPOSITION OF CIRCUITS * 231
22.1 THE BASIC CONCEPT 231
22.2 CATENATION 233
22.3 CHOOSING A GENERIC FUNCTION 234
22.4 HINGE SETS 236
22.5 COMPOSING A CIRCUIT: EXAMPLE 1 236
22.6 COMPOSING A CIRCUIT: EXAMPLE 2 239
22.7 COMPOSING A CIRCUIT: EXAMPLE 3 239
23 HAZARDS 242
23.1 HAZARDS ON STATIONARY SIGNALS 242
23.2 SINGLE-INPUT HAZARDS 243
23.3 GATES AND DELAYS 245
23.4 DETECTING SINGLE-INPUT HAZARDS 246
23.5 HAZARD-DETECTING FORMULAS 248
23.6 HAZARDS IN A NOT-AND CIRCUIT 249
23.7 HAZARDS IN A COMPOSED CIRCUIT 251
DIVISION FOUR LATCHES
24 MEMORISING BY FEEDBACK 255
24.1 WHAT IS MEMORISATION? 255
24.2 THE FEEDBACK MODEL OF MEMORY 258
24.3 TRANSIENT VERSUS STATIONARY BEHAVIOUR 261
24.4 LATCHES WITHOUT FEEDBACK 263
24.5 IS A DELAY IN THE FEEDBACK NECESSARY? * 264
25 BASIC THEORY OF LATCHES 267
25.1 WHAT IS A LATCH?* 267
25.2 SPECIFYING LATCHES IN REDUCED K-MAPS* 269
25.3 EVALUATION FORMULAS AND GENERIC LATCHES* 270
25.4 AN EVALUATION EXAMPLE 272
25.5 IDENTICAL AND ISOMORPHIC LATCHES* 273
25.6 INVERTING A SAMPLE MEMORY-CIRCUIT 275
25.7 GENERAL NEGATION OF LATCHES * 277
26 OPTIMISED LATCHES 279
26.1 DESIGNING MINIMISED LATCHES* 279
26.2 A MINIMISED LATCH*AN EXAMPLE 280
26.3 DESIGNING HAZARD-FREE LATCHES* 282
26.4 A HAZARD-FREE LATCH*AN EXAMPLE 285
27 ELEMENTARY LATCHES 288
27.1 CLASSIFICATION OF ELEMENTARY LATCHES 288
27.2 TWO SYSTEMS OF SYMBOLIC LATCHES * 291
27.3 SYMBOLS WITH COMPLEMENTARY OUTPUTS * 293
27.4 SYMBOLIC LATCHES WITH A COMMON EVENT * 294
27.5 STANDARD SYMBOLS FOR ELEMENTARY LATCHES 297
28 COMPOSITION OF LATCHES * 300
28.1 CATENATION DIAGRAM FOR LATCHES 300
28.2 COMPOSING THE D-LATCH USING A SR-LATCH 302
28.3 CHECKING FOR A HAZARD-FREE SOLUTION 303
28.4 AVOIDING UNDESIRABLE INPUT-EVENTS 305
DIVISION FIVE SEQUENTIAL CIRCUITS WITH
CONTINUOUSLY READ INPUTS
29 AUTOMATA AND PROGRAMS * 311
29.1 CONTINUOUSLY READING AUTOMATA 311
29.2 DEVELOPING AN EXAMPLE FLOW TABLE 313
29.3 THE WORD-RECOGNITION TREE 318
29.4 EVALUATING A SEQUENTIAL CIRCUIT 320
30 WORD-RECOGNITION TABLES * 325
30.1 DEVELOPING WORD-RECOGNITION TABLES 325
30.2 PRIMITIVE DETERMINATENESS 327
30.3 GENERAL DETERMINATENESS 330
30.4 EVALUATION AND PARTIAL MAPPINGS 332
30.5 TESTING FOR GENERAL DETERMINATENESS 333
31 CATENATION MODEL * 335
31.1 THE MOORE AND MEALY MODELS 335
31.2 CATENATION MODEL * FEEDBACK AND DELAYS 337
31.3 MOORE AND MEALY FLOW TABLES 340
31.4 MERGING MOORE AND MEALY FLOW TABLES 341
31.5 FROM MEALY TO MOORE FLOW TABLES 344
31.6 THE COMPOSITE WORD-RECOGNITION TABLE 345
32 TOGGLE CIRCUITS 349
32.1 T-FLIPFLOP * ITS FEEDBACK DESIGN 349
32.2 T-FLIPFLOP * ITS COMPOSITION 352
- 32.3 JK-FLIPFLOP * ITS FEEDBACK DESIGN 355
32.4 JK-FLIPFLOP * ITS COMPOSITION 357
33 TRIGGERING AND SYNCHRONISING 360
33.1 TRIGGERING 360
33.2 SAMPLING 363
33.3 SYNCHRONISING 366
34 VERIFYING A LOGIC DESIGN * 370
34.1 A VERIFICATION-DSE FOR THE D-LATCH 370
34.2 A VERIFICATION-DSE FOR A GIVEN EXAMPLE 376
34.3 GRAFTING A VERIFICATION TREE 379
35 DISCUSSING HUFFMAN S THEORY 385
35.1 BASICS OF HUFFMAN S SYNTHESIS PROCEDURE* 386
35.2 DELAY AND FEEDBACK 387
35.3 STATE ENCODING AND CIRCUIT REALISATION 389
35.4 PROBLEMS WITH ARBITRARY BINARY ENCODINGS 392
35.5 RACE ANALYSIS IN THE CATENATION MODEL * 394
36 STATE ENCODING TECHNIQUES 398
36.1 INTRODUCING MULTIPLE STATE-TRANSITIONS 399
36.2 ADDING UNSTABLE STATES INTUITIVELY 401
36.3 ON THE NUMBER OF ADJACENT ENCODINGS 402
36.4 ONE-HOT CODE 403
36.5 SAFE BUT SLOW STANDARDISED ENCODINGS 404
36.6 SAFE AND FAST STANDARDISED ENCODINGS 408
36.7 NUMBER OF REQUIRED STATE VARIABLES 410
BIBLIOGRAPHY 411
INDEX 415
|
| any_adam_object | 1 |
| author | Vingron, Shimon Peter 1936- |
| author_GND | (DE-588)125011407 |
| author_facet | Vingron, Shimon Peter 1936- |
| author_role | aut |
| author_sort | Vingron, Shimon Peter 1936- |
| author_variant | s p v sp spv |
| building | Verbundindex |
| bvnumber | BV020820924 |
| callnumber-first | T - Technology |
| callnumber-label | TK7868 |
| callnumber-raw | TK7868.S9V56 2003 |
| callnumber-search | TK7868.S9V56 2003 |
| callnumber-sort | TK 47868 S9 V56 42003 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | ST 195 ZN 5620 |
| classification_tum | ELT 450f DAT 195f |
| ctrlnum | (OCoLC)52547706 (DE-599)BVBBV020820924 |
| dewey-full | 621.3815/37222 621.3815/372 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.3815/372 22 621.3815/372 |
| dewey-search | 621.3815/372 22 621.3815/372 |
| dewey-sort | 3621.3815 3372 222 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik Elektrotechnik Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02207nam a2200589 c 4500</leader><controlfield tag="001">BV020820924</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060206 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">051006s2004 gw ad|| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">968585345</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540403434</subfield><subfield code="c">Pp. : EUR 106.95, sfr 155.00</subfield><subfield code="9">3-540-40343-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52547706</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV020820924</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-521</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7868.S9V56 2003</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3815/372 22</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3815/372</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 195</subfield><subfield code="0">(DE-625)143608:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 5620</subfield><subfield code="0">(DE-625)157469:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 450f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">37</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vingron, Shimon Peter</subfield><subfield code="d">1936-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)125011407</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Switching theory</subfield><subfield code="b">insight through predicate logic</subfield><subfield code="c">Shimon P. Vingron</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">428 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Engineering online library</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 411 - 413</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Switching theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Predicate (Logic)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logischer Entwurf</subfield><subfield code="0">(DE-588)4168051-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prädikatenlogik</subfield><subfield code="0">(DE-588)4046974-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Sequenzielle Logik</subfield><subfield code="0">(DE-588)4323079-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltalgebra</subfield><subfield code="0">(DE-588)4179375-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Digitalschaltung</subfield><subfield code="0">(DE-588)4012295-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Digitalschaltung</subfield><subfield code="0">(DE-588)4012295-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Logischer Entwurf</subfield><subfield code="0">(DE-588)4168051-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Schaltalgebra</subfield><subfield code="0">(DE-588)4179375-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Sequenzielle Logik</subfield><subfield code="0">(DE-588)4323079-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Prädikatenlogik</subfield><subfield code="0">(DE-588)4046974-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013526296&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013526296</subfield></datafield></record></collection> |
| id | DE-604.BV020820924 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:14:03Z |
| institution | BVB |
| isbn | 3540403434 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013526296 |
| oclc_num | 52547706 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-521 |
| owner_facet | DE-91 DE-BY-TUM DE-521 |
| physical | 428 S. Ill., graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer |
| record_format | marc |
| series2 | Engineering online library |
| spelling | Vingron, Shimon Peter 1936- Verfasser (DE-588)125011407 aut Switching theory insight through predicate logic Shimon P. Vingron Berlin u.a. Springer 2004 428 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Engineering online library Literaturverz. S. 411 - 413 Switching theory Predicate (Logic) Logischer Entwurf (DE-588)4168051-0 gnd rswk-swf Prädikatenlogik (DE-588)4046974-8 gnd rswk-swf Sequenzielle Logik (DE-588)4323079-9 gnd rswk-swf Schaltalgebra (DE-588)4179375-4 gnd rswk-swf Digitalschaltung (DE-588)4012295-5 gnd rswk-swf Digitalschaltung (DE-588)4012295-5 s Logischer Entwurf (DE-588)4168051-0 s Schaltalgebra (DE-588)4179375-4 s Sequenzielle Logik (DE-588)4323079-9 s Prädikatenlogik (DE-588)4046974-8 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013526296&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Vingron, Shimon Peter 1936- Switching theory insight through predicate logic Switching theory Predicate (Logic) Logischer Entwurf (DE-588)4168051-0 gnd Prädikatenlogik (DE-588)4046974-8 gnd Sequenzielle Logik (DE-588)4323079-9 gnd Schaltalgebra (DE-588)4179375-4 gnd Digitalschaltung (DE-588)4012295-5 gnd |
| subject_GND | (DE-588)4168051-0 (DE-588)4046974-8 (DE-588)4323079-9 (DE-588)4179375-4 (DE-588)4012295-5 |
| title | Switching theory insight through predicate logic |
| title_auth | Switching theory insight through predicate logic |
| title_exact_search | Switching theory insight through predicate logic |
| title_full | Switching theory insight through predicate logic Shimon P. Vingron |
| title_fullStr | Switching theory insight through predicate logic Shimon P. Vingron |
| title_full_unstemmed | Switching theory insight through predicate logic Shimon P. Vingron |
| title_short | Switching theory |
| title_sort | switching theory insight through predicate logic |
| title_sub | insight through predicate logic |
| topic | Switching theory Predicate (Logic) Logischer Entwurf (DE-588)4168051-0 gnd Prädikatenlogik (DE-588)4046974-8 gnd Sequenzielle Logik (DE-588)4323079-9 gnd Schaltalgebra (DE-588)4179375-4 gnd Digitalschaltung (DE-588)4012295-5 gnd |
| topic_facet | Switching theory Predicate (Logic) Logischer Entwurf Prädikatenlogik Sequenzielle Logik Schaltalgebra Digitalschaltung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013526296&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT vingronshimonpeter switchingtheoryinsightthroughpredicatelogic |