Logic and computation: interactive proof with Cambridge LCF
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge u.a.
Cambridge Univ. Pr.
1987
|
Ausgabe: | 1. publ. |
Schriftenreihe: | Cambridge tracts in theoretical computer science.
2. |
Schlagworte: | |
Beschreibung: | XIII, 302 S. |
ISBN: | 0521346320 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV002290866 | ||
003 | DE-604 | ||
005 | 20221018 | ||
007 | t | ||
008 | 890928s1987 |||| 00||| eng d | ||
020 | |a 0521346320 |9 0-521-34632-0 | ||
035 | |a (OCoLC)246548450 | ||
035 | |a (DE-599)BVBBV002290866 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G |a DE-384 |a DE-703 |a DE-29T |a DE-19 |a DE-83 |a DE-739 |a DE-706 |a DE-188 | ||
084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a DAT 542f |2 stub | ||
084 | |a DAT 706f |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 |
250 | |a 1. publ. | ||
264 | 1 | |a Cambridge u.a. |b Cambridge Univ. Pr. |c 1987 | |
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. | |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
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 |
689 | 0 | 0 | |a Berechenbare Funktion |0 (DE-588)4135762-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 Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 1 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
689 | 2 | |8 1\p |5 DE-604 | |
830 | 0 | |a Cambridge tracts in theoretical computer science. |v 2. |w (DE-604)BV000754528 |9 2. | |
940 | 1 | |q TUB-nveb | |
999 | |a oai:aleph.bib-bvb.de:BVB01-001505429 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804116750604697600 |
---|---|
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 | BV002290866 |
classification_rvk | ST 125 SK 130 ST 130 |
classification_tum | DAT 542f DAT 706f |
ctrlnum | (OCoLC)246548450 (DE-599)BVBBV002290866 |
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>01926nam a2200517 cb4500</leader><controlfield tag="001">BV002290866</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221018 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1987 |||| 00||| eng d</controlfield><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)246548450</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002290866</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</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></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Pr.</subfield><subfield code="c">1987</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="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="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="689" ind1="0" 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="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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-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="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">1\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="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001505429</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></record></collection> |
id | DE-604.BV002290866 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T15:43:28Z |
institution | BVB |
isbn | 0521346320 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001505429 |
oclc_num | 246548450 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM DE-384 DE-703 DE-29T DE-19 DE-BY-UBM DE-83 DE-739 DE-706 DE-188 |
owner_facet | DE-91G DE-BY-TUM DE-384 DE-703 DE-29T DE-19 DE-BY-UBM DE-83 DE-739 DE-706 DE-188 |
physical | XIII, 302 S. |
psigel | TUB-nveb |
publishDate | 1987 |
publishDateSearch | 1987 |
publishDateSort | 1987 |
publisher | Cambridge Univ. Pr. |
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 1. publ. Cambridge u.a. Cambridge Univ. Pr. 1987 XIII, 302 S. txt rdacontent n rdamedia nc rdacarrier Cambridge tracts in theoretical computer science. 2. Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf 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 Berechenbare Funktion (DE-588)4135762-0 s Mathematische Logik (DE-588)4037951-6 s DE-604 Berechenbarkeit (DE-588)4138368-0 s Logische Programmierung (DE-588)4195096-3 s 1\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 |
spellingShingle | Paulson, Lawrence C. Logic and computation interactive proof with Cambridge LCF Cambridge tracts in theoretical computer science. Berechenbarkeit (DE-588)4138368-0 gnd Mathematische Logik (DE-588)4037951-6 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Logische Programmierung (DE-588)4195096-3 gnd |
subject_GND | (DE-588)4138368-0 (DE-588)4037951-6 (DE-588)4135762-0 (DE-588)4195096-3 |
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 |
title_fullStr | Logic and computation interactive proof with Cambridge LCF |
title_full_unstemmed | Logic and computation interactive proof with Cambridge LCF |
title_short | Logic and computation |
title_sort | logic and computation interactive proof with cambridge lcf |
title_sub | interactive proof with Cambridge LCF |
topic | Berechenbarkeit (DE-588)4138368-0 gnd Mathematische Logik (DE-588)4037951-6 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Logische Programmierung (DE-588)4195096-3 gnd |
topic_facet | Berechenbarkeit Mathematische Logik Berechenbare Funktion Logische Programmierung |
volume_link | (DE-604)BV000754528 |
work_keys_str_mv | AT paulsonlawrencec logicandcomputationinteractiveproofwithcambridgelcf |