A Lindström theorem for modal logic:
Abstract: "A modal analogue of Lindström's characterization of first-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of finite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultraproducts over...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1994
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,56 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A modal analogue of Lindström's characterization of first-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of finite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultraproducts over [omega]." |
Beschreibung: | 13 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010175664 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 950510s1994 |||| 00||| engod | ||
035 | |a (OCoLC)32882266 | ||
035 | |a (DE-599)BVBBV010175664 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Rijke, Maarten de |e Verfasser |4 aut | |
245 | 1 | 0 | |a A Lindström theorem for modal logic |c M. de Rijke |
264 | 1 | |a Amsterdam |c 1994 | |
300 | |a 13 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 94,56 | |
520 | 3 | |a Abstract: "A modal analogue of Lindström's characterization of first-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of finite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultraproducts over [omega]." | |
650 | 4 | |a Concurrent programming | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,56 |w (DE-604)BV008928356 |9 94,56 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006758444 |
Datensatz im Suchindex
_version_ | 1804124572861071360 |
---|---|
any_adam_object | |
author | Rijke, Maarten de |
author_facet | Rijke, Maarten de |
author_role | aut |
author_sort | Rijke, Maarten de |
author_variant | m d r md mdr |
building | Verbundindex |
bvnumber | BV010175664 |
ctrlnum | (OCoLC)32882266 (DE-599)BVBBV010175664 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01225nam a2200277 cb4500</leader><controlfield tag="001">BV010175664</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32882266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010175664</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="100" ind1="1" ind2=" "><subfield code="a">Rijke, Maarten de</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Lindström theorem for modal logic</subfield><subfield code="c">M. de Rijke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">94,56</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A modal analogue of Lindström's characterization of first-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of finite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultraproducts over [omega]."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">94,56</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,56</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006758444</subfield></datafield></record></collection> |
id | DE-604.BV010175664 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:47:48Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006758444 |
oclc_num | 32882266 |
open_access_boolean | |
physical | 13 S. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Rijke, Maarten de Verfasser aut A Lindström theorem for modal logic M. de Rijke Amsterdam 1994 13 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,56 Abstract: "A modal analogue of Lindström's characterization of first-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of finite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultraproducts over [omega]." Concurrent programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,56 (DE-604)BV008928356 94,56 |
spellingShingle | Rijke, Maarten de A Lindström theorem for modal logic Concurrent programming |
title | A Lindström theorem for modal logic |
title_auth | A Lindström theorem for modal logic |
title_exact_search | A Lindström theorem for modal logic |
title_full | A Lindström theorem for modal logic M. de Rijke |
title_fullStr | A Lindström theorem for modal logic M. de Rijke |
title_full_unstemmed | A Lindström theorem for modal logic M. de Rijke |
title_short | A Lindström theorem for modal logic |
title_sort | a lindstrom theorem for modal logic |
topic | Concurrent programming |
topic_facet | Concurrent programming |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT rijkemaartende alindstromtheoremformodallogic |