On the complexity of prefix formulas in modal logic of subset spaces:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
Hagen
Fernuniv., Fachbereich Informatik
1996
|
| Schriftenreihe: | Informatik-Berichte
202 |
| Umfang: | 28 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011027002 | ||
| 003 | DE-604 | ||
| 005 | 19961122 | ||
| 007 | t| | ||
| 008 | 961021s1996 gw |||| 00||| ger d | ||
| 016 | 7 | |a 948741546 |2 DE-101 | |
| 035 | |a (OCoLC)64538045 | ||
| 035 | |a (DE-599)BVBBV011027002 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Heinemann, Bernhard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the complexity of prefix formulas in modal logic of subset spaces |c Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik |
| 264 | 1 | |a Hagen |b Fernuniv., Fachbereich Informatik |c 1996 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Informatik-Berichte |v 202 | |
| 830 | 0 | |a Informatik-Berichte |v 202 |w (DE-604)BV000001277 |9 202 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007383093 | |
Datensatz im Suchindex
| _version_ | 1818953362066898944 |
|---|---|
| any_adam_object | |
| author | Heinemann, Bernhard |
| author_facet | Heinemann, Bernhard |
| author_role | aut |
| author_sort | Heinemann, Bernhard |
| author_variant | b h bh |
| building | Verbundindex |
| bvnumber | BV011027002 |
| ctrlnum | (OCoLC)64538045 (DE-599)BVBBV011027002 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00936nam a2200289 cb4500</leader><controlfield tag="001">BV011027002</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961122 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">961021s1996 gw |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">948741546</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)64538045</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011027002</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heinemann, Bernhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of prefix formulas in modal logic of subset spaces</subfield><subfield code="c">Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hagen</subfield><subfield code="b">Fernuniv., Fachbereich Informatik</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">Informatik-Berichte</subfield><subfield code="v">202</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Informatik-Berichte</subfield><subfield code="v">202</subfield><subfield code="w">(DE-604)BV000001277</subfield><subfield code="9">202</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007383093</subfield></datafield></record></collection> |
| id | DE-604.BV011027002 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:05:04Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007383093 |
| oclc_num | 64538045 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 28 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Fernuniv., Fachbereich Informatik |
| record_format | marc |
| series | Informatik-Berichte |
| series2 | Informatik-Berichte |
| spelling | Heinemann, Bernhard Verfasser aut On the complexity of prefix formulas in modal logic of subset spaces Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik Hagen Fernuniv., Fachbereich Informatik 1996 28 S. txt rdacontent n rdamedia nc rdacarrier Informatik-Berichte 202 Informatik-Berichte 202 (DE-604)BV000001277 202 |
| spellingShingle | Heinemann, Bernhard On the complexity of prefix formulas in modal logic of subset spaces Informatik-Berichte |
| title | On the complexity of prefix formulas in modal logic of subset spaces |
| title_auth | On the complexity of prefix formulas in modal logic of subset spaces |
| title_exact_search | On the complexity of prefix formulas in modal logic of subset spaces |
| title_full | On the complexity of prefix formulas in modal logic of subset spaces Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik |
| title_fullStr | On the complexity of prefix formulas in modal logic of subset spaces Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik |
| title_full_unstemmed | On the complexity of prefix formulas in modal logic of subset spaces Bernhard Heinemann. Fernuniversität, Gesamthochschule, in Hagen, Fachbereich Informatik |
| title_short | On the complexity of prefix formulas in modal logic of subset spaces |
| title_sort | on the complexity of prefix formulas in modal logic of subset spaces |
| volume_link | (DE-604)BV000001277 |
| work_keys_str_mv | AT heinemannbernhard onthecomplexityofprefixformulasinmodallogicofsubsetspaces |