Ordinal complexity of recursive programs and their termination proofs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
Univ. of Edinburgh, Department of Computer Science
1992
|
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. 101 - 102. - Zugl.: Edinburgh, Univ., Diss., 1991 |
| Beschreibung: | 102 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV006149284 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 930107s1992 m||| 00||| eng d | ||
| 035 | |a (OCoLC)222534086 | ||
| 035 | |a (DE-599)BVBBV006149284 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 517d |2 stub | ||
| 088 | |a CST 88 92 | ||
| 088 | |a ECS LFCS 92 196 | ||
| 100 | 1 | |a Fairtlough, Matthew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Ordinal complexity of recursive programs and their termination proofs |c Matthew V. H. Fairtlough |
| 246 | 1 | 3 | |a CST 88 92 |
| 246 | 1 | 3 | |a ECS LFCS 92 196 |
| 264 | 1 | |a Edinburgh |b Univ. of Edinburgh, Department of Computer Science |c 1992 | |
| 300 | |a 102 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 101 - 102. - Zugl.: Edinburgh, Univ., Diss., 1991 | ||
| 650 | 4 | |a Computers | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003888408 | ||
Datensatz im Suchindex
| _version_ | 1804120376925487104 |
|---|---|
| any_adam_object | |
| author | Fairtlough, Matthew V. |
| author_facet | Fairtlough, Matthew V. |
| author_role | aut |
| author_sort | Fairtlough, Matthew V. |
| author_variant | m v f mv mvf |
| building | Verbundindex |
| bvnumber | BV006149284 |
| classification_tum | DAT 517d |
| ctrlnum | (OCoLC)222534086 (DE-599)BVBBV006149284 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01056nam a2200337 c 4500</leader><controlfield tag="001">BV006149284</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930107s1992 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)222534086</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006149284</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></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CST 88 92</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">ECS LFCS 92 196</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fairtlough, Matthew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ordinal complexity of recursive programs and their termination proofs</subfield><subfield code="c">Matthew V. H. Fairtlough</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CST 88 92</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">ECS LFCS 92 196</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="b">Univ. of Edinburgh, Department of Computer Science</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">102 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 101 - 102. - Zugl.: Edinburgh, Univ., Diss., 1991</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003888408</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV006149284 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:41:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003888408 |
| oclc_num | 222534086 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 102 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Univ. of Edinburgh, Department of Computer Science |
| record_format | marc |
| spelling | Fairtlough, Matthew V. Verfasser aut Ordinal complexity of recursive programs and their termination proofs Matthew V. H. Fairtlough CST 88 92 ECS LFCS 92 196 Edinburgh Univ. of Edinburgh, Department of Computer Science 1992 102 S. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 101 - 102. - Zugl.: Edinburgh, Univ., Diss., 1991 Computers (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Fairtlough, Matthew V. Ordinal complexity of recursive programs and their termination proofs Computers |
| subject_GND | (DE-588)4113937-9 |
| title | Ordinal complexity of recursive programs and their termination proofs |
| title_alt | CST 88 92 ECS LFCS 92 196 |
| title_auth | Ordinal complexity of recursive programs and their termination proofs |
| title_exact_search | Ordinal complexity of recursive programs and their termination proofs |
| title_full | Ordinal complexity of recursive programs and their termination proofs Matthew V. H. Fairtlough |
| title_fullStr | Ordinal complexity of recursive programs and their termination proofs Matthew V. H. Fairtlough |
| title_full_unstemmed | Ordinal complexity of recursive programs and their termination proofs Matthew V. H. Fairtlough |
| title_short | Ordinal complexity of recursive programs and their termination proofs |
| title_sort | ordinal complexity of recursive programs and their termination proofs |
| topic | Computers |
| topic_facet | Computers Hochschulschrift |
| work_keys_str_mv | AT fairtloughmatthewv ordinalcomplexityofrecursiveprogramsandtheirterminationproofs AT fairtloughmatthewv cst8892 AT fairtloughmatthewv ecslfcs92196 |