A proof system for finite trees:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Saarbrücken
Univ. des Saarlandes, Computerlinguistik
1995
|
| Schriftenreihe: | Universität <Saarbrücken> / Computerlinguistik: Computerlinguistik an der Universität des Saarlandes
67 |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010604820 | ||
| 003 | DE-604 | ||
| 005 | 20200123 | ||
| 007 | t | ||
| 008 | 960209s1995 |||| 00||| eng d | ||
| 016 | 7 | |a 946612722 |2 DE-101 | |
| 035 | |a (OCoLC)75702458 | ||
| 035 | |a (DE-599)BVBBV010604820 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Blackburn, Patrick |d 1959- |e Verfasser |0 (DE-588)174091478 |4 aut | |
| 245 | 1 | 0 | |a A proof system for finite trees |c Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke |
| 264 | 1 | |a Saarbrücken |b Univ. des Saarlandes, Computerlinguistik |c 1995 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Saarbrücken> / Computerlinguistik: Computerlinguistik an der Universität des Saarlandes |v 67 | |
| 700 | 1 | |a Meyer-Viol, Wilfried |e Verfasser |4 aut | |
| 700 | 1 | |a Rijke, Maarten de |e Verfasser |4 aut | |
| 810 | 2 | |a Computerlinguistik: Computerlinguistik an der Universität des Saarlandes |t Universität <Saarbrücken> |v 67 |w (DE-604)BV008907964 |9 67 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007073835 | ||
Datensatz im Suchindex
| _version_ | 1804125078118465536 |
|---|---|
| any_adam_object | |
| author | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de |
| author_GND | (DE-588)174091478 |
| author_facet | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de |
| author_role | aut aut aut |
| author_sort | Blackburn, Patrick 1959- |
| author_variant | p b pb w m v wmv m d r md mdr |
| building | Verbundindex |
| bvnumber | BV010604820 |
| ctrlnum | (OCoLC)75702458 (DE-599)BVBBV010604820 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01155nam a2200301 cb4500</leader><controlfield tag="001">BV010604820</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200123 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960209s1995 |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">946612722</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75702458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010604820</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Blackburn, Patrick</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)174091478</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A proof system for finite trees</subfield><subfield code="c">Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken</subfield><subfield code="b">Univ. des Saarlandes, Computerlinguistik</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Universität <Saarbrücken> / Computerlinguistik: Computerlinguistik an der Universität des Saarlandes</subfield><subfield code="v">67</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyer-Viol, Wilfried</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rijke, Maarten de</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computerlinguistik: Computerlinguistik an der Universität des Saarlandes</subfield><subfield code="t">Universität <Saarbrücken></subfield><subfield code="v">67</subfield><subfield code="w">(DE-604)BV008907964</subfield><subfield code="9">67</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007073835</subfield></datafield></record></collection> |
| id | DE-604.BV010604820 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007073835 |
| oclc_num | 75702458 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 19 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Univ. des Saarlandes, Computerlinguistik |
| record_format | marc |
| series2 | Universität <Saarbrücken> / Computerlinguistik: Computerlinguistik an der Universität des Saarlandes |
| spelling | Blackburn, Patrick 1959- Verfasser (DE-588)174091478 aut A proof system for finite trees Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke Saarbrücken Univ. des Saarlandes, Computerlinguistik 1995 19 S. txt rdacontent n rdamedia nc rdacarrier Universität <Saarbrücken> / Computerlinguistik: Computerlinguistik an der Universität des Saarlandes 67 Meyer-Viol, Wilfried Verfasser aut Rijke, Maarten de Verfasser aut Computerlinguistik: Computerlinguistik an der Universität des Saarlandes Universität <Saarbrücken> 67 (DE-604)BV008907964 67 |
| spellingShingle | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de A proof system for finite trees |
| title | A proof system for finite trees |
| title_auth | A proof system for finite trees |
| title_exact_search | A proof system for finite trees |
| title_full | A proof system for finite trees Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke |
| title_fullStr | A proof system for finite trees Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke |
| title_full_unstemmed | A proof system for finite trees Patrick Blackburn ; Wilfried Meyer-Viol ; Maarten de Rijke |
| title_short | A proof system for finite trees |
| title_sort | a proof system for finite trees |
| volume_link | (DE-604)BV008907964 |
| work_keys_str_mv | AT blackburnpatrick aproofsystemforfinitetrees AT meyerviolwilfried aproofsystemforfinitetrees AT rijkemaartende aproofsystemforfinitetrees |