Logic and computation: interactive proof with Cambridge LCF
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge u.a.
Cambridge Univ. Press
1990
|
| Ausgabe: | 1. paperback ed. |
| Schriftenreihe: | Cambridge tracts in theoretical computer science
2 |
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. 289 - 295 |
| Beschreibung: | XIII, 302 S. |
| ISBN: | 0521395607 0521346320 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006618355 | ||
| 003 | DE-604 | ||
| 005 | 19940725 | ||
| 007 | t | ||
| 008 | 930315s1990 |||| 00||| eng d | ||
| 020 | |a 0521395607 |9 0-521-39560-7 | ||
| 020 | |a 0521346320 |9 0-521-34632-0 | ||
| 035 | |a (OCoLC)40239066 | ||
| 035 | |a (DE-599)BVBBV006618355 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 050 | 0 | |a QA9.59 | |
| 082 | 0 | |a 004.1/25 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a DAT 706f |2 stub | ||
| 084 | |a DAT 542f |2 stub | ||
| 100 | 1 | |a Paulson, Lawrence C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Logic and computation |b interactive proof with Cambridge LCF |c Lawrence C. Paulson |
| 250 | |a 1. paperback ed. | ||
| 264 | 1 | |a Cambridge u.a. |b Cambridge Univ. Press |c 1990 | |
| 300 | |a XIII, 302 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v 2 | |
| 500 | |a Literaturverz. S. 289 - 295 | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Cambridge LCF (Computer system) | |
| 650 | 4 | |a Computable functions |x Data processing | |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |D s |
| 689 | 1 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 830 | 0 | |a Cambridge tracts in theoretical computer science |v 2 |w (DE-604)BV000754528 |9 2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004229198 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804120894631575552 |
|---|---|
| any_adam_object | |
| author | Paulson, Lawrence C. |
| author_facet | Paulson, Lawrence C. |
| author_role | aut |
| author_sort | Paulson, Lawrence C. |
| author_variant | l c p lc lcp |
| building | Verbundindex |
| bvnumber | BV006618355 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.59 |
| callnumber-search | QA9.59 |
| callnumber-sort | QA 19.59 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 |
| classification_tum | DAT 706f DAT 542f |
| ctrlnum | (OCoLC)40239066 (DE-599)BVBBV006618355 |
| dewey-full | 004.1/25 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.1/25 |
| dewey-search | 004.1/25 |
| dewey-sort | 14.1 225 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| edition | 1. paperback ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02134nam a2200577 cb4500</leader><controlfield tag="001">BV006618355</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940725 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930315s1990 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521395607</subfield><subfield code="9">0-521-39560-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521346320</subfield><subfield code="9">0-521-34632-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)40239066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006618355</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="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.59</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.1/25</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">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Paulson, Lawrence C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic and computation</subfield><subfield code="b">interactive proof with Cambridge LCF</subfield><subfield code="c">Lawrence C. Paulson</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. paperback ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 302 S.</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="1" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">2</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 289 - 295</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cambridge LCF (Computer system)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield><subfield code="x">Data processing</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="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="650" ind1="0" ind2="7"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="689" ind1="1" ind2="0"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV000754528</subfield><subfield code="9">2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004229198</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV006618355 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:49:20Z |
| institution | BVB |
| isbn | 0521395607 0521346320 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004229198 |
| oclc_num | 40239066 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XIII, 302 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| series | Cambridge tracts in theoretical computer science |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Paulson, Lawrence C. Verfasser aut Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson 1. paperback ed. Cambridge u.a. Cambridge Univ. Press 1990 XIII, 302 S. txt rdacontent n rdamedia nc rdacarrier Cambridge tracts in theoretical computer science 2 Literaturverz. S. 289 - 295 Datenverarbeitung Cambridge LCF (Computer system) Computable functions Data processing Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Berechenbare Funktion (DE-588)4135762-0 gnd rswk-swf Logische Programmierung (DE-588)4195096-3 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s Mathematische Logik (DE-588)4037951-6 s DE-604 Berechenbare Funktion (DE-588)4135762-0 s 1\p DE-604 Logische Programmierung (DE-588)4195096-3 s 2\p DE-604 Cambridge tracts in theoretical computer science 2 (DE-604)BV000754528 2 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Paulson, Lawrence C. Logic and computation interactive proof with Cambridge LCF Cambridge tracts in theoretical computer science Datenverarbeitung Cambridge LCF (Computer system) Computable functions Data processing Mathematische Logik (DE-588)4037951-6 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Logische Programmierung (DE-588)4195096-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4135762-0 (DE-588)4195096-3 (DE-588)4138368-0 |
| title | Logic and computation interactive proof with Cambridge LCF |
| title_auth | Logic and computation interactive proof with Cambridge LCF |
| title_exact_search | Logic and computation interactive proof with Cambridge LCF |
| title_full | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_fullStr | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_full_unstemmed | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_short | Logic and computation |
| title_sort | logic and computation interactive proof with cambridge lcf |
| title_sub | interactive proof with Cambridge LCF |
| topic | Datenverarbeitung Cambridge LCF (Computer system) Computable functions Data processing Mathematische Logik (DE-588)4037951-6 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Logische Programmierung (DE-588)4195096-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Datenverarbeitung Cambridge LCF (Computer system) Computable functions Data processing Mathematische Logik Berechenbare Funktion Logische Programmierung Berechenbarkeit |
| volume_link | (DE-604)BV000754528 |
| work_keys_str_mv | AT paulsonlawrencec logicandcomputationinteractiveproofwithcambridgelcf |