Logic and its applications:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
London [u.a.]
Prentice Hall
1996
|
| Ausgabe: | 1. publ. |
| Schriftenreihe: | Prentice Hall international series in computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVIII, 310 S. graph. Darst. |
| ISBN: | 0130302635 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010958253 | ||
| 003 | DE-604 | ||
| 005 | 20030320 | ||
| 007 | t | ||
| 008 | 960919s1996 xxkd||| |||| 00||| eng d | ||
| 020 | |a 0130302635 |9 0-13-030263-5 | ||
| 035 | |a (OCoLC)33665857 | ||
| 035 | |a (DE-599)BVBBV010958253 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c XA-GB | ||
| 049 | |a DE-739 |a DE-91G |a DE-20 |a DE-521 |a DE-83 | ||
| 050 | 0 | |a QA76.63.B87 1996 | |
| 082 | 0 | |a 511.3 |2 20 | |
| 082 | 0 | |a 005.131 | |
| 082 | 0 | |a 511.3 20 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 084 | |a MAT 030f |2 stub | ||
| 084 | |a 03-01 |2 msc | ||
| 100 | 1 | |a Burke, Edmund K. |d 1964- |e Verfasser |0 (DE-588)124111068 |4 aut | |
| 245 | 1 | 0 | |a Logic and its applications |c Edmund Burke and Eric Foxley |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a London [u.a.] |b Prentice Hall |c 1996 | |
| 300 | |a XVIII, 310 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Prentice Hall international series in computer science | |
| 650 | 7 | |a Kunstmatige intelligentie |2 gtt | |
| 650 | 7 | |a Logisch programmeren |2 gtt | |
| 650 | 7 | |a Predicatenlogica |2 gtt | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Foxley, Eric |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007330171&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007330171 | ||
Datensatz im Suchindex
| _version_ | 1804125445798494208 |
|---|---|
| adam_text | LOGIC AND ITS APPLICATIONS EDMUND BURKE AND ERIC FOXLEY PRENTICE HALL
LONDON NEW YORK TORONTO SYDNEY TOKYO SINGAPORE MADRID MEXICO CITY MUNICH
CONTENTS PREFACE XIII PROPOSITIONAL LOGIC 1 1.1 INFORMAL INTRODUCTION 1
1.2 LOGICAL CONNECTIVES 2 1.2.1 NEGATION (NOT) 2 1.2.2 CONJUNCTION (AND)
2 1.2.3 DISJUNCTION (OR) 4 1.2.4 IMPLICATION 5 1.2.5 EQUIVALENCE 1 1.2.6
SUM AND PRODUCT NOTATIONS 1 1.2.7 PRIORITIES OF OPERATORS 8 1.3
TRUTH-TABLES OF FORMULAE 9 1.3.1 HOW TO CONSTRUCT THE TRUTH-TABLE OF A
FORMULA 9 1.3.2 IDENTICAL TRUTH-TABLES 11 1.3.3 INTERPRETATIONS AND
MODEIS 12 1.3.4 TAUTOLOGIES, ABSURDITIES AND MIXED FORMULAE 12 1.4 OTHER
LOGICAL CONNECTIVES 14 1.4.1 TRUTH FUNCTIONS 14 1.4.2 MONODIE OPERATORS
15 1.4.3 DYADIC OPERATORS 15 1.4.4 TRIADIC OPERATORS 17 1.4.5
REPRESENTING TRUTH FUNCTIONS IN TERMS OFDYADIC AND MONADIC OPERATORS 19
1.5 MANIPULATING PROPOSITIONAL FORMULAE 20 1.5.1 STANDARD IDENTITIES 20
1.5.2 COMPLETE SETS OF CONNECTIVES 21 1.5.3 OTHER COMPLETE SETS OF
CONNECTIVES 22 1.5.4 SHEFFER FUNCTIONS 23 V CONTENTS 1.5.5 NORMALFORMS
1.6 THE NEGATION OF PROPOSITIONAL FORMULAE 1.6.1 DEFINITION 1.6.2
GENERALIZED DE MORGAN S LAW 1.6.3 EXTENDED DISJUNCTION AND COENJUNCTION
1.6.4 DUALITY 1.7 ARGUMENTS AND ARGUMENT FORMS 1.7.1 SOME DEFINITIONS
ASSOCIATED WITH FORMULAE 1.7.2 SOME RULES FOR PROPOSITIONAL FORMULAE
1.7.3 THE VALIDITY OF AN ARGUMENT 1.7.4 MATHEMATICAL IF-AND-ONLY-IF
PROOFS 1.7.5 A THEOREM 1.7.6 ANOTHER THEOREM 1.8 SUMMARY 1.9 WORKED
EXAMPLES 1.10 EXERCISES FORMAL APPROACH TO PROPOSITIONAL LOGIC 2.1
INTRODUCTION 2.1.1 FORMAL SYSTEMS OF PROPOSITIONAL LOGIC 2.1.2 PROOFS
AND DEDUCTIONS 2.1.3 CONSTRUCTING FORMAL SYSTEMS 2.1.4 77IE RELATIONSHIP
BETWEEN FORMAL SYSTEMS AND INTERPRETATIONS 2.2 THE FORMAL PROPOSITIONAL
LOGIC SYSTEM L 2.2.1 THE CONSTRUCTION OF SYSTEM L 2.2.2 PROOFS IN SYSTEM
L 2.2.3 DEDUCTIONS IN SYSTEM L 2.2.4 DERIVED RULES OF INFERENCE IN
SYSTEM L 2.2.5 EXAMPLES 2.2.6 NOTATION FOR RULES 2.3 THE SOUNDNESS AND
COMPLETENESS THEOREMS FOR SYSTEM 2.3.1 INTRODUCTION 2.3.2 THE SOUNDNESS
THEOREM FOR SYSTEM L 2.3.3 THE COMPLETENESS THEOREM FOR SYSTEM L 2.4
INDEPENDENCE OF AXIOMS AND RULES 2.5 LEMMON S SYSTEM OF PROPOSITIONAL
LOGIC 2.5.1 AN INTRODUCTION TO THE SYSTEM 2.5.2 PROOFS AND DEDUCTIONS IN
LEMMON S SYSTEM 2.5.3 EXAMPLES OF DEDUCTIONS IN LEMMON S SYSTEM 2.6
SUMMARY 2.7 WORKED EXAMPLES 2.8 EXERCISES CONTENTS VII 3 APPLICATIONS TO
LOGIC DESIGN 3.1 3.2 3.3 3.4 3.5 3.6 3.7 INTRODUCTION SIMPLIFICATION
TECHNIQUES 3.2.1 A SIMPLE EXAMPLE 3.2.2 KARNAUGH MAPS 3.2.3
QUINE-MCCLUSKY MINIMIZATION UNIVERSAL DECISION ELEMENTS (UDES) 3.3.1
DEFINITION 3.3.2 A FEW FOUR-VARIABLE UNIVERSAL DECISION ELEMENTS LOGIC
DESIGN 3.4.1 BINARY ARITHMETIC ADDERS 3.4.2 SEQUENTIAL LOGIC SUMMARY
WORKED EXAMPLES EXERCISES 4 PREDICATE LOGIC 4.1 4.2 4.3 4.4 INFORMAL
INTRODUCTION 4.1.1 BACKGROUND 4.1.2 UNIVERSAL AND EXISTENTIAL
QUANTIFIERS 4.1.3 TRANSLATING BETWEEN FIRST-ORDER LANGUAGES AND THE
ENGLISH LANGUAGE 4.1.4 HINTS FOR TRANSLATING FROM ENGLISH TO LOGIC 4.1.5
EXAMPLES 4.1.6 SUMMARY 4.1.7 EXERCISES THE SEMANTICS OF PREDICATE LOGIC
4.2.1 FIRST-ORDER LANGUAGES 4.2.2 INTERPRETATIONS 4.2.3 SATISFACTION
4.2.4 TRUTH-TABLES OF INTERPRETATIONS 4.2.5 HERBRAND INTERPRETATIONS
4.2.6 SUMMARY 4.2.7 WORKED EXAMPLES 4.2.8 EXERCISES SYNTACTICAL SYSTEMS
OF PREDICATE LOGIC 4.3.1 THE SYSTEM K OF PREDICATE LOGIC 4.3.2
DISCUSSION OF THE SYSTEM K 4.3.3 FIRST-ORDER THEORIES 4.3.4 SUMMARY
4.3.5 WORKED EXAMPLE 4.3.6 EXERCISES SOUNDNESS AND COMPLETENESS 95 95 98
98 101 105 110 111 111 113 113 115 122 122 128 131 131 131 133 136 139
140 141 142 143 143 148 151 153 155 157 157 159 161 162 163 171 173 173
174 175 VIII CONTENTS 4.4.1 INTRODUCTION 175 4.4.2 THE SOUNDNESS OF
SYSTEM K 176 4.4.3 CONSISTENCY 180 4.4.4 THE COMPLETENESS OF SYSTEM K
180 4.4.5 SUMMARY 185 4.4.6 WORKED EXAMPLES 185 4.4.7 EXERCISES 188 5
LOGIC PROGRAMMING 190 5.1 INTRODUCTION 190 5.2 PROGRAMMING WITH
PROPOSITIONAL LOGIC 190 5.2.1 DEFINITIONS FOR PROPOSITIONAL LOGIC 190
5.2.2 PROPOSITIONAL RESOLUTION 191 5.2.3 REFUTATION AND DEDUCTIONS 193
5.2.4 NEGATION IN LOGIC PROGRAMMING 198 5.2.5 SLD-RESOLUTION 199 5.3
CLAUSAL FORM FOR PREDICATE LOGIC 202 5.3.1 PRENEXFORM 202 5.3.2 CLAUSAL
FORM 204 5.3.3 HOERN CLAUSES 206 5.4 THE SEMANTICS OF LOGIC PROGRAMMING
207 5.4.1 HOERN CLAUSES AND THEIR HERBRAND MODEIS 20 9 5.4.2 LOGIC
PROGRAMS AND THEIR HERBRAND MODEIS 210 5.4.3 LEAST HERBRAND MODEIS 210
5.4.4 CONSTRUCTION OF LEAST HERBRAND MODEIS 211 5.5 UNIFICATION AND
ANSWER SUBSTITUTIONS 214 5.5.1 SUBSTITUTIONS 214 5.5.2 UNIFICATION 216
5.5.3 PRACTICALITIES 218 5.6 PROGRAMMING WITH PREDICATE LOGIC 219 5.6.1
THE RESOLUTION RULE 219 5.6.2 THE PROOF STRATEGY OF PROLOG:
SLD-RESOLUTION 219 5.6.3 NEGATION IN LOGIC PROGRAMMING: THE CLOSED-WORLD
ASSUMPTION 222 5.7 CONCLUDING REMARKS 223 5.8 WORKED EXAMPLES 224 5.9
EXERCISES 228 6 FORMAL SYSTEM SPECIFICATION 232 6.1 INTRODUCTION 232
6.1.1 A SIMPLE EXAMPLE 233 6.1.2 A STATE SCHEMA 233 6.1.3 OPERATIONS OR
EVENTS AND THEIR SCHEMA 235 CONTENTS IX 6.1.4 PRE-AND POST-CONDITIONS
241 6.2 NOTATIONAL DIFFERENCES 241 6.3 THE Z SPECIFICATION LANGUAGE 243
6.3.1 BASIC TYPE DEFINITIONS 244 6.3.2 FREE TYPE DEFINITIONS 244 6.3.3
SCHEMA INCLUSION 245 6.3.4 SCHEMA TYPES 245 6.3.5 EXAMPLE: A COMPUTER
FILE SYSTEM 249 6.3.6 AXIOM SCHEMA 255 6.4 SCHEMA ALGEBRA 256 6.4.1
LINEARNOTATION 256 6.4.2 SCHEMA EXTENSION 256 6.4.3 SOME OTHER TYPES OF
DEFINITION 256 6.4.4 SCHEMA INCLUSION 257 6.4.5 THE TUPLE AND PRED
OPERATORS 257 6.4.6 ORNAMENTATION OF SCHEMA NAMES 257 6.4.7 LOGICAL
OPERATIONS ON SCHEMA 257 6.4.8 SCHEMA QUANTIFICATION 258 6.4.9
IDENTIFIER RENAMING 259 6.4.10 IDENTIFIER HIDING 259 6.4.11 SCHEMA
PRE-CONDITION 260 6.4.12 SCHEMA COMPOSITION 260 6.4.13 SCHEMA PIPING 262
6.4.14 AXIOMATIC DESCRIPTIONS 26 3 6.5 SUMMARY 263 6.6 WORKED EXAMPLES
264 6.6.1 SOME SIMPLE EXAMPLES 264 6.6.2 CASE STUDY: A VIDEO-RENTAL SHOP
271 6.6.3 CASE STUDY: A CAR-FERRY TERMINAL 214 6.7 EXERCISES 282
APPENDIX A: MATHEMATICAL BACKGROUND 284 AI INDUCTION PROOFS 284 A2 SET
THEORY 286 A2.1 COMPREHENSIVE SPECIFICATION OF A SET 286 A2.2 OPERATIONS
INVOLVING SETS 287 A3 BAGS 288 A4 RELATIONS 289 A4.1 DOMAIN AND RAENGE
289 A4.2 COMPOSITION 290 A4.3 DOMAIN AND RAENGE OPERATIONS 290 A4.4
OVERRIDE OPERATION 292 A4.5 SET IMAGE 292 X CONTENTS 293 294 295 297 297
297 300 300 APPENDIX C: SYMBOLS USED IN THE BOOK 302 A5 A6 A4.6
EQUIVALENCE RELATIONS FUNCTIONS SEQUENCES APPENDIX B: OTHER NOTATIONS BL
B2 B3 B4 ALTERNATIVE NOTATIONS POLISH NOTATION WORKED EXAMPLES EXERCISES
INDEX 305
|
| any_adam_object | 1 |
| author | Burke, Edmund K. 1964- Foxley, Eric |
| author_GND | (DE-588)124111068 |
| author_facet | Burke, Edmund K. 1964- Foxley, Eric |
| author_role | aut aut |
| author_sort | Burke, Edmund K. 1964- |
| author_variant | e k b ek ekb e f ef |
| building | Verbundindex |
| bvnumber | BV010958253 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.63.B87 1996 |
| callnumber-search | QA76.63.B87 1996 |
| callnumber-sort | QA 276.63 B87 41996 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 ST 120 |
| classification_tum | MAT 030f |
| ctrlnum | (OCoLC)33665857 (DE-599)BVBBV010958253 |
| dewey-full | 511.3 005.131 511.320 |
| dewey-hundreds | 500 - Natural sciences and mathematics 000 - Computer science, information, general works |
| dewey-ones | 511 - General principles of mathematics 005 - Computer programming, programs, data, security |
| dewey-raw | 511.3 005.131 511.3 20 |
| dewey-search | 511.3 005.131 511.3 20 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01804nam a2200505 c 4500</leader><controlfield tag="001">BV010958253</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030320 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960919s1996 xxkd||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0130302635</subfield><subfield code="9">0-13-030263-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33665857</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010958253</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">XA-GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.63.B87 1996</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 030f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">03-01</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Burke, Edmund K.</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124111068</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic and its applications</subfield><subfield code="c">Edmund Burke and Eric Foxley</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Prentice Hall</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 310 S.</subfield><subfield code="b">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">Prentice Hall international series in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kunstmatige intelligentie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logisch programmeren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Predicatenlogica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Foxley, Eric</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=007330171&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-007330171</subfield></datafield></record></collection> |
| id | DE-604.BV010958253 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:01:41Z |
| institution | BVB |
| isbn | 0130302635 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007330171 |
| oclc_num | 33665857 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-20 DE-521 DE-83 |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-20 DE-521 DE-83 |
| physical | XVIII, 310 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Prentice Hall |
| record_format | marc |
| series2 | Prentice Hall international series in computer science |
| spelling | Burke, Edmund K. 1964- Verfasser (DE-588)124111068 aut Logic and its applications Edmund Burke and Eric Foxley 1. publ. London [u.a.] Prentice Hall 1996 XVIII, 310 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Prentice Hall international series in computer science Kunstmatige intelligentie gtt Logisch programmeren gtt Predicatenlogica gtt Logic programming Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 s DE-604 Foxley, Eric Verfasser aut GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007330171&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Burke, Edmund K. 1964- Foxley, Eric Logic and its applications Kunstmatige intelligentie gtt Logisch programmeren gtt Predicatenlogica gtt Logic programming Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd |
| subject_GND | (DE-588)4037951-6 |
| title | Logic and its applications |
| title_auth | Logic and its applications |
| title_exact_search | Logic and its applications |
| title_full | Logic and its applications Edmund Burke and Eric Foxley |
| title_fullStr | Logic and its applications Edmund Burke and Eric Foxley |
| title_full_unstemmed | Logic and its applications Edmund Burke and Eric Foxley |
| title_short | Logic and its applications |
| title_sort | logic and its applications |
| topic | Kunstmatige intelligentie gtt Logisch programmeren gtt Predicatenlogica gtt Logic programming Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd |
| topic_facet | Kunstmatige intelligentie Logisch programmeren Predicatenlogica Logic programming Logic, Symbolic and mathematical Mathematische Logik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007330171&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT burkeedmundk logicanditsapplications AT foxleyeric logicanditsapplications |