A Proof of Kamp's theorem

DOI10.2168/LMCS-10(1:14)2014zbMATH Open1326.03024arXiv1401.2580OpenAlexW1979919662MaRDI QIDQ5404480FDOQ5404480

Authors: Alexander Rabinovich 

Publication date: 24 March 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: We provide a simple proof of Kamp's theorem.

Full work available at URL: https://arxiv.org/abs/1401.2580

zbMATH Keywords

temporal logicexpressive completenessmonadic logic

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70)

Cited In (19)

• A first-order logic characterization of safety and co-safety languages
• Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
• No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic
• Separation logics and modalities: a survey
• Title not available (Why is that?)
• On a theorem of Campana and P\u{a}un
• First-order rewritability of ontology-mediated queries in linear temporal logic
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
• A logical characterization of timed regular languages
• The Expressive Power of Temporal and First-Order Metric Logics
• Expressive completeness of separation logic with two variables and no separating conjunction
• Regular \(\omega\)-languages with an informative right congruence
• On almost future temporal logics
• Early detection of temporal constraint violations
• A first-order logic characterisation of safety and co-safety languages
• A proof of the Cameron-Ku conjecture
• A proof of Stavi's theorem
• On the complexity of infinite advice strings
• Title not available (Why is that?)

This page was built for publication: A Proof of Kamp's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404480)