Abstract
We provide a simple proof of Kamp's theorem.
BibTeX - Entry
@InProceedings{rabinovich:LIPIcs:2012:3694,
author = {Alexander Rabinovich},
title = {{A Proof of Kamp's theorem}},
booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
pages = {516--527},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-42-2},
ISSN = {1868-8969},
year = {2012},
volume = {16},
editor = {Patrick C{\'e}gielski and Arnaud Durand},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3694},
URN = {urn:nbn:de:0030-drops-36945},
doi = {10.4230/LIPIcs.CSL.2012.516},
annote = {Keywords: Temporal Logic, Monadic Logic, Expressive Completeness}
}
Keywords: |
|
Temporal Logic, Monadic Logic, Expressive Completeness |
Collection: |
|
Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL |
Issue Date: |
|
2012 |
Date of publication: |
|
03.09.2012 |