Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets
Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorith...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer New York
2001
|
| Ausgabe: | 1st ed. 2001 |
| Schriftenreihe: | Monographs in Computer Science
|
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction. The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning |
| Beschreibung: | 1 Online-Ressource (XVIII, 409 p. 1 illus) |
| ISBN: | 9781475734522 |
| DOI: | 10.1007/978-1-4757-3452-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064263 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475734522 |9 978-1-4757-3452-2 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3452-2 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4757-3452-2 | ||
| 035 | |a (OCoLC)1227480761 | ||
| 035 | |a (DE-599)BVBBV047064263 | ||
| 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 ST 300 |0 (DE-625)143650: |2 rvk | ||
| 100 | 1 | |a Cantone, Domenico |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Set Theory for Computing |b From Decision Procedures to Declarative Programming with Sets |c by Domenico Cantone, Eugenio Omodeo, Alberto Policriti |
| 250 | |a 1st ed. 2001 | ||
| 264 | 1 | |a New York, NY |b Springer New York |c 2001 | |
| 300 | |a 1 Online-Ressource (XVIII, 409 p. 1 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Monographs in Computer Science | |
| 520 | |a Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction. The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning | ||
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Programming Languages, Compilers, Interpreters | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 0 | 7 | |a Mengenlehre |0 (DE-588)4074715-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |D s |
| 689 | 0 | 1 | |a Mengenlehre |0 (DE-588)4074715-3 |D s |
| 689 | 0 | 2 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Omodeo, Eugenio |4 aut | |
| 700 | 1 | |a Policriti, Alberto |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441929051 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387951973 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475734539 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3452-2 |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-032471375 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4757-3452-2 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062050050048 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto |
| author_facet | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto |
| author_role | aut aut aut |
| author_sort | Cantone, Domenico |
| author_variant | d c dc e o eo a p ap |
| building | Verbundindex |
| bvnumber | BV047064263 |
| classification_rvk | ST 300 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4757-3452-2 (OCoLC)1227480761 (DE-599)BVBBV047064263 |
| 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 |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4757-3452-2 |
| edition | 1st ed. 2001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03382nmm a2200625zc 4500</leader><controlfield tag="001">BV047064263</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475734522</subfield><subfield code="9">978-1-4757-3452-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3452-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4757-3452-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227480761</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064263</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">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cantone, Domenico</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Set Theory for Computing</subfield><subfield code="b">From Decision Procedures to Declarative Programming with Sets</subfield><subfield code="c">by Domenico Cantone, Eugenio Omodeo, Alberto Policriti</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 409 p. 1 illus)</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">Monographs in Computer Science</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction. The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Languages, Compilers, Interpreters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</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">Mathematical logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</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">Omodeo, Eugenio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Policriti, Alberto</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">9781441929051</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">9780387951973</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">9781475734539</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3452-2</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-032471375</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-3452-2</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.BV047064263 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781475734522 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471375 |
| oclc_num | 1227480761 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVIII, 409 p. 1 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer New York |
| record_format | marc |
| series2 | Monographs in Computer Science |
| spelling | Cantone, Domenico Verfasser aut Set Theory for Computing From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, Alberto Policriti 1st ed. 2001 New York, NY Springer New York 2001 1 Online-Ressource (XVIII, 409 p. 1 illus) txt rdacontent c rdamedia cr rdacarrier Monographs in Computer Science Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction. The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning Theory of Computation Programming Languages, Compilers, Interpreters Mathematics of Computing Mathematical Logic and Formal Languages Computers Programming languages (Electronic computers) Computer science—Mathematics Mathematical logic Mengenlehre (DE-588)4074715-3 gnd rswk-swf Deklarative Programmierung (DE-588)4293503-9 gnd rswk-swf Berechenbare Funktion (DE-588)4135762-0 gnd rswk-swf Deklarative Programmierung (DE-588)4293503-9 s Mengenlehre (DE-588)4074715-3 s Berechenbare Funktion (DE-588)4135762-0 s DE-604 Omodeo, Eugenio aut Policriti, Alberto aut Erscheint auch als Druck-Ausgabe 9781441929051 Erscheint auch als Druck-Ausgabe 9780387951973 Erscheint auch als Druck-Ausgabe 9781475734539 https://doi.org/10.1007/978-1-4757-3452-2 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Cantone, Domenico Omodeo, Eugenio Policriti, Alberto Set Theory for Computing From Decision Procedures to Declarative Programming with Sets Theory of Computation Programming Languages, Compilers, Interpreters Mathematics of Computing Mathematical Logic and Formal Languages Computers Programming languages (Electronic computers) Computer science—Mathematics Mathematical logic Mengenlehre (DE-588)4074715-3 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd |
| subject_GND | (DE-588)4074715-3 (DE-588)4293503-9 (DE-588)4135762-0 |
| title | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets |
| title_auth | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets |
| title_exact_search | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets |
| title_exact_search_txtP | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets |
| title_full | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, Alberto Policriti |
| title_fullStr | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, Alberto Policriti |
| title_full_unstemmed | Set Theory for Computing From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, Alberto Policriti |
| title_short | Set Theory for Computing |
| title_sort | set theory for computing from decision procedures to declarative programming with sets |
| title_sub | From Decision Procedures to Declarative Programming with Sets |
| topic | Theory of Computation Programming Languages, Compilers, Interpreters Mathematics of Computing Mathematical Logic and Formal Languages Computers Programming languages (Electronic computers) Computer science—Mathematics Mathematical logic Mengenlehre (DE-588)4074715-3 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd |
| topic_facet | Theory of Computation Programming Languages, Compilers, Interpreters Mathematics of Computing Mathematical Logic and Formal Languages Computers Programming languages (Electronic computers) Computer science—Mathematics Mathematical logic Mengenlehre Deklarative Programmierung Berechenbare Funktion |
| url | https://doi.org/10.1007/978-1-4757-3452-2 |
| work_keys_str_mv | AT cantonedomenico settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets AT omodeoeugenio settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets AT policritialberto settheoryforcomputingfromdecisionprocedurestodeclarativeprogrammingwithsets |