A primitive recursive set theory and AFA: on the logical complexity of the largest bisimulation
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Amsterdam
Centrum voor Wiskunde en Informatica
1992
|
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV024378542 | ||
| 003 | DE-604 | ||
| 005 | 20090910 | ||
| 007 | t | ||
| 008 | 930115s1992 t||| 00||| und d | ||
| 035 | |a (OCoLC)257780511 | ||
| 035 | |a (DE-599)BVBBV024378542 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | |a und | ||
| 049 | |a DE-83 | ||
| 088 | |a CS R9213 | ||
| 100 | 1 | |a Fernando, R. T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A primitive recursive set theory and AFA |b on the logical complexity of the largest bisimulation |c R. T. P. Fernando |
| 264 | 1 | |a Amsterdam |b Centrum voor Wiskunde en Informatica |c 1992 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018358546 | ||
Datensatz im Suchindex
| _version_ | 1804140336863248384 |
|---|---|
| any_adam_object | |
| author | Fernando, R. T. |
| author_facet | Fernando, R. T. |
| author_role | aut |
| author_sort | Fernando, R. T. |
| author_variant | r t f rt rtf |
| building | Verbundindex |
| bvnumber | BV024378542 |
| ctrlnum | (OCoLC)257780511 (DE-599)BVBBV024378542 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00758nam a2200253 c 4500</leader><controlfield tag="001">BV024378542</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930115s1992 t||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)257780511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024378542</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CS R9213</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fernando, R. T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A primitive recursive set theory and AFA</subfield><subfield code="b">on the logical complexity of the largest bisimulation</subfield><subfield code="c">R. T. P. Fernando</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Centrum voor Wiskunde en Informatica</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018358546</subfield></datafield></record></collection> |
| id | DE-604.BV024378542 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:58:22Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018358546 |
| oclc_num | 257780511 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 15 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Centrum voor Wiskunde en Informatica |
| record_format | marc |
| spelling | Fernando, R. T. Verfasser aut A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation R. T. P. Fernando Amsterdam Centrum voor Wiskunde en Informatica 1992 15 S. txt rdacontent n rdamedia nc rdacarrier |
| spellingShingle | Fernando, R. T. A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation |
| title | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation |
| title_auth | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation |
| title_exact_search | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation |
| title_full | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation R. T. P. Fernando |
| title_fullStr | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation R. T. P. Fernando |
| title_full_unstemmed | A primitive recursive set theory and AFA on the logical complexity of the largest bisimulation R. T. P. Fernando |
| title_short | A primitive recursive set theory and AFA |
| title_sort | a primitive recursive set theory and afa on the logical complexity of the largest bisimulation |
| title_sub | on the logical complexity of the largest bisimulation |
| work_keys_str_mv | AT fernandort aprimitiverecursivesettheoryandafaonthelogicalcomplexityofthelargestbisimulation |