Descriptive complexity and finite models: proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Providence, RI
AMS
1997
|
Schriftenreihe: | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science
31 |
Schlagworte: | |
Beschreibung: | XIV, 248 S. graph. Darst. |
ISBN: | 0821805177 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011596314 | ||
003 | DE-604 | ||
005 | 20081230 | ||
007 | t | ||
008 | 971028s1997 d||| |||| 10||| eng d | ||
020 | |a 0821805177 |9 0-8218-0517-7 | ||
035 | |a (OCoLC)36181102 | ||
035 | |a (DE-599)BVBBV011596314 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-739 |a DE-20 |a DE-11 | ||
050 | 0 | |a QA267.7 | |
082 | 0 | |a 511.3 |2 21 | |
084 | |a SD 1996 |0 (DE-625)142730: |2 rvk | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
245 | 1 | 0 | |a Descriptive complexity and finite models |b proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University |c Neil Immerman ... ed. |
264 | 1 | |a Providence, RI |b AMS |c 1997 | |
300 | |a XIV, 248 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 31 | |
650 | 7 | |a Automates mathématiques, Théorie des - Congrès |2 ram | |
650 | 7 | |a Berekenbaarheid |2 gtt | |
650 | 7 | |a Complexiteit |2 gtt | |
650 | 7 | |a Complexité de calcul (informatique) - Congrès |2 ram | |
650 | 7 | |a Eindige wiskunde |2 gtt | |
650 | 7 | |a Graphes, Théorie des - Congrès |2 ram | |
650 | 7 | |a Jeux intellectuels - Congrès |2 ram | |
650 | 7 | |a Modalité (logique) - Congrès |2 ram | |
650 | 7 | |a Modeltheorie |2 gtt | |
650 | 7 | |a Modèles, Théorie des - Congrès |2 ram | |
650 | 7 | |a Raisonnement - Congrès |2 ram | |
650 | 7 | |a Recursie |2 gtt | |
650 | 7 | |a complexité |2 inriac | |
650 | 7 | |a logique modale |2 inriac | |
650 | 7 | |a modèle fini |2 inriac | |
650 | 4 | |a Computational complexity |v Congresses | |
650 | 4 | |a Model theory |v Congresses | |
650 | 0 | 7 | |a Modelltheorie |0 (DE-588)4114617-7 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1996 |z Princeton NJ |2 gnd-content | |
689 | 0 | 0 | |a Modelltheorie |0 (DE-588)4114617-7 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Immerman, Neil |d 1953- |e Sonstige |0 (DE-588)12076718X |4 oth | |
711 | 2 | |a Workshop on Descriptive Complexity and Finite Models |d 1996 |c Princeton, NJ |j Sonstige |0 (DE-588)5246527-5 |4 oth | |
830 | 0 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 31 |w (DE-604)BV004648770 |9 31 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007811263 |
Datensatz im Suchindex
_version_ | 1804126125416251392 |
---|---|
any_adam_object | |
author_GND | (DE-588)12076718X |
building | Verbundindex |
bvnumber | BV011596314 |
callnumber-first | Q - Science |
callnumber-label | QA267 |
callnumber-raw | QA267.7 |
callnumber-search | QA267.7 |
callnumber-sort | QA 3267.7 |
callnumber-subject | QA - Mathematics |
classification_rvk | SD 1996 SK 130 |
ctrlnum | (OCoLC)36181102 (DE-599)BVBBV011596314 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Conference Proceeding Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02476nam a2200589 cb4500</leader><controlfield tag="001">BV011596314</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20081230 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">971028s1997 d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821805177</subfield><subfield code="9">0-8218-0517-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36181102</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011596314</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-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1996</subfield><subfield code="0">(DE-625)142730:</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="245" ind1="1" ind2="0"><subfield code="a">Descriptive complexity and finite models</subfield><subfield code="b">proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University</subfield><subfield code="c">Neil Immerman ... ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, RI</subfield><subfield code="b">AMS</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 248 S.</subfield><subfield code="b">graph. Darst.</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">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">31</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berekenbaarheid</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Eindige wiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Jeux intellectuels - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Modalité (logique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Modeltheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Modèles, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Raisonnement - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique modale</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">modèle fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Model theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modelltheorie</subfield><subfield code="0">(DE-588)4114617-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1996</subfield><subfield code="z">Princeton NJ</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Modelltheorie</subfield><subfield code="0">(DE-588)4114617-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Immerman, Neil</subfield><subfield code="d">1953-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)12076718X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">Workshop on Descriptive Complexity and Finite Models</subfield><subfield code="d">1996</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)5246527-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">31</subfield><subfield code="w">(DE-604)BV004648770</subfield><subfield code="9">31</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007811263</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 1996 Princeton NJ gnd-content |
genre_facet | Konferenzschrift 1996 Princeton NJ |
id | DE-604.BV011596314 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:12:29Z |
institution | BVB |
institution_GND | (DE-588)5246527-5 |
isbn | 0821805177 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007811263 |
oclc_num | 36181102 |
open_access_boolean | |
owner | DE-739 DE-20 DE-11 |
owner_facet | DE-739 DE-20 DE-11 |
physical | XIV, 248 S. graph. Darst. |
publishDate | 1997 |
publishDateSearch | 1997 |
publishDateSort | 1997 |
publisher | AMS |
record_format | marc |
series | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
series2 | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
spelling | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University Neil Immerman ... ed. Providence, RI AMS 1997 XIV, 248 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 31 Automates mathématiques, Théorie des - Congrès ram Berekenbaarheid gtt Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Eindige wiskunde gtt Graphes, Théorie des - Congrès ram Jeux intellectuels - Congrès ram Modalité (logique) - Congrès ram Modeltheorie gtt Modèles, Théorie des - Congrès ram Raisonnement - Congrès ram Recursie gtt complexité inriac logique modale inriac modèle fini inriac Computational complexity Congresses Model theory Congresses Modelltheorie (DE-588)4114617-7 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1996 Princeton NJ gnd-content Modelltheorie (DE-588)4114617-7 s DE-604 Immerman, Neil 1953- Sonstige (DE-588)12076718X oth Workshop on Descriptive Complexity and Finite Models 1996 Princeton, NJ Sonstige (DE-588)5246527-5 oth Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 31 (DE-604)BV004648770 31 |
spellingShingle | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science Automates mathématiques, Théorie des - Congrès ram Berekenbaarheid gtt Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Eindige wiskunde gtt Graphes, Théorie des - Congrès ram Jeux intellectuels - Congrès ram Modalité (logique) - Congrès ram Modeltheorie gtt Modèles, Théorie des - Congrès ram Raisonnement - Congrès ram Recursie gtt complexité inriac logique modale inriac modèle fini inriac Computational complexity Congresses Model theory Congresses Modelltheorie (DE-588)4114617-7 gnd |
subject_GND | (DE-588)4114617-7 (DE-588)1071861417 |
title | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University |
title_auth | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University |
title_exact_search | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University |
title_full | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University Neil Immerman ... ed. |
title_fullStr | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University Neil Immerman ... ed. |
title_full_unstemmed | Descriptive complexity and finite models proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University Neil Immerman ... ed. |
title_short | Descriptive complexity and finite models |
title_sort | descriptive complexity and finite models proceedings of a dimacs workshop january 14 17 1996 princeton university |
title_sub | proceedings of a DIMACS workshop, January 14 - 17, 1996, Princeton University |
topic | Automates mathématiques, Théorie des - Congrès ram Berekenbaarheid gtt Complexiteit gtt Complexité de calcul (informatique) - Congrès ram Eindige wiskunde gtt Graphes, Théorie des - Congrès ram Jeux intellectuels - Congrès ram Modalité (logique) - Congrès ram Modeltheorie gtt Modèles, Théorie des - Congrès ram Raisonnement - Congrès ram Recursie gtt complexité inriac logique modale inriac modèle fini inriac Computational complexity Congresses Model theory Congresses Modelltheorie (DE-588)4114617-7 gnd |
topic_facet | Automates mathématiques, Théorie des - Congrès Berekenbaarheid Complexiteit Complexité de calcul (informatique) - Congrès Eindige wiskunde Graphes, Théorie des - Congrès Jeux intellectuels - Congrès Modalité (logique) - Congrès Modeltheorie Modèles, Théorie des - Congrès Raisonnement - Congrès Recursie complexité logique modale modèle fini Computational complexity Congresses Model theory Congresses Modelltheorie Konferenzschrift 1996 Princeton NJ |
volume_link | (DE-604)BV004648770 |
work_keys_str_mv | AT immermanneil descriptivecomplexityandfinitemodelsproceedingsofadimacsworkshopjanuary14171996princetonuniversity AT workshopondescriptivecomplexityandfinitemodelsprincetonnj descriptivecomplexityandfinitemodelsproceedingsofadimacsworkshopjanuary14171996princetonuniversity |