A Proof of Kamp's theorem
From MaRDI portal
Publication:5404480
DOI10.2168/LMCS-10(1:14)2014zbMath1326.03024arXiv1401.2580OpenAlexW1979919662MaRDI QIDQ5404480
Publication date: 24 March 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2580
Related Items (16)
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction ⋮ The Expressive Power of Temporal and First-Order Metric Logics ⋮ On Almost Future Temporal Logics ⋮ Separation logics and modalities: a survey ⋮ A first-order logic characterization of safety and co-safety languages ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Early detection of temporal constraint violations ⋮ A first-order logic characterisation of safety and co-safety languages ⋮ Unnamed Item ⋮ On the Complexity of Infinite Advice Strings ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ A logical characterization of timed regular languages ⋮ Unnamed Item ⋮ No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic
This page was built for publication: A Proof of Kamp's theorem
