Logic and Complexity:
Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London
Springer London
2004
|
| Ausgabe: | 1st ed. 2004 |
| Schriftenreihe: | Discrete Mathematics and Theoretical Computer Science
|
| Schlagworte: | |
| Online-Zugang: | UBY01 URL des Eerstveröffentlichers |
| Zusammenfassung: | Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest |
| Beschreibung: | 1 Online-Ressource (X, 361 p) |
| ISBN: | 9780857293923 |
| DOI: | 10.1007/978-0-85729-392-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064580 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9780857293923 |9 978-0-85729-392-3 | ||
| 024 | 7 | |a 10.1007/978-0-85729-392-3 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-0-85729-392-3 | ||
| 035 | |a (OCoLC)1227477889 | ||
| 035 | |a (DE-599)BVBBV047064580 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Lassaigne, Richard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Logic and Complexity |c by Richard Lassaigne, Michel de Rougemont |
| 250 | |a 1st ed. 2004 | ||
| 264 | 1 | |a London |b Springer London |c 2004 | |
| 300 | |a 1 Online-Ressource (X, 361 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Discrete Mathematics and Theoretical Computer Science | |
| 520 | |a Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest | ||
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Computer System Implementation | |
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Probability Theory and Stochastic Processes | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Logics and Meanings of Programs | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 4 | |a Architecture, Computer | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 4 | |a Probabilities | |
| 650 | 4 | |a Calculus of variations | |
| 650 | 4 | |a Computer logic | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 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 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Rougemont, Michel de |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781447110521 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781852335656 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780857293930 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-85729-392-3 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471692 | ||
| 966 | e | |u https://doi.org/10.1007/978-0-85729-392-3 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062821801984 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Lassaigne, Richard Rougemont, Michel de |
| author_facet | Lassaigne, Richard Rougemont, Michel de |
| author_role | aut aut |
| author_sort | Lassaigne, Richard |
| author_variant | r l rl m d r md mdr |
| building | Verbundindex |
| bvnumber | BV047064580 |
| classification_rvk | SK 130 ST 130 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-0-85729-392-3 (OCoLC)1227477889 (DE-599)BVBBV047064580 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/978-0-85729-392-3 |
| edition | 1st ed. 2004 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03656nmm a2200649zc 4500</leader><controlfield tag="001">BV047064580</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780857293923</subfield><subfield code="9">978-0-85729-392-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-85729-392-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-0-85729-392-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477889</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064580</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</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 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lassaigne, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic and Complexity</subfield><subfield code="c">by Richard Lassaigne, Michel de Rougemont</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2004</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 361 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Discrete Mathematics and Theoretical Computer Science</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer System Implementation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability Theory and Stochastic Processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logics and Meanings of Programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Architecture, Computer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilities</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of variations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Rougemont, Michel de</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781447110521</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781852335656</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780857293930</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-0-85729-392-3</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471692</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-0-85729-392-3</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064580 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9780857293923 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471692 |
| oclc_num | 1227477889 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (X, 361 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer London |
| record_format | marc |
| series2 | Discrete Mathematics and Theoretical Computer Science |
| spelling | Lassaigne, Richard Verfasser aut Logic and Complexity by Richard Lassaigne, Michel de Rougemont 1st ed. 2004 London Springer London 2004 1 Online-Ressource (X, 361 p) txt rdacontent c rdamedia cr rdacarrier Discrete Mathematics and Theoretical Computer Science Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest Discrete Mathematics in Computer Science Computer System Implementation Mathematical Logic and Foundations Probability Theory and Stochastic Processes Calculus of Variations and Optimal Control; Optimization Logics and Meanings of Programs Computer science—Mathematics Architecture, Computer Mathematical logic Probabilities Calculus of variations Computer logic Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Rougemont, Michel de aut Erscheint auch als Druck-Ausgabe 9781447110521 Erscheint auch als Druck-Ausgabe 9781852335656 Erscheint auch als Druck-Ausgabe 9780857293930 https://doi.org/10.1007/978-0-85729-392-3 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Lassaigne, Richard Rougemont, Michel de Logic and Complexity Discrete Mathematics in Computer Science Computer System Implementation Mathematical Logic and Foundations Probability Theory and Stochastic Processes Calculus of Variations and Optimal Control; Optimization Logics and Meanings of Programs Computer science—Mathematics Architecture, Computer Mathematical logic Probabilities Calculus of variations Computer logic Komplexitätstheorie (DE-588)4120591-1 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4037951-6 |
| title | Logic and Complexity |
| title_auth | Logic and Complexity |
| title_exact_search | Logic and Complexity |
| title_exact_search_txtP | Logic and Complexity |
| title_full | Logic and Complexity by Richard Lassaigne, Michel de Rougemont |
| title_fullStr | Logic and Complexity by Richard Lassaigne, Michel de Rougemont |
| title_full_unstemmed | Logic and Complexity by Richard Lassaigne, Michel de Rougemont |
| title_short | Logic and Complexity |
| title_sort | logic and complexity |
| topic | Discrete Mathematics in Computer Science Computer System Implementation Mathematical Logic and Foundations Probability Theory and Stochastic Processes Calculus of Variations and Optimal Control; Optimization Logics and Meanings of Programs Computer science—Mathematics Architecture, Computer Mathematical logic Probabilities Calculus of variations Computer logic Komplexitätstheorie (DE-588)4120591-1 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| topic_facet | Discrete Mathematics in Computer Science Computer System Implementation Mathematical Logic and Foundations Probability Theory and Stochastic Processes Calculus of Variations and Optimal Control; Optimization Logics and Meanings of Programs Computer science—Mathematics Architecture, Computer Mathematical logic Probabilities Calculus of variations Computer logic Komplexitätstheorie Mathematische Logik |
| url | https://doi.org/10.1007/978-0-85729-392-3 |
| work_keys_str_mv | AT lassaignerichard logicandcomplexity AT rougemontmichelde logicandcomplexity |