A Proof of Kamp's theorem

Alexander Rabinovich - A Proof of Kamp's theorem

lmcs:730 - Logical Methods in Computer Science, February 18, 2014, Volume 10, Issue 1 - https://doi.org/10.2168/LMCS-10(1:14)2014

A Proof of Kamp's theoremArticle

Authors: Alexander Rabinovich

We provide a simple proof of Kamp's theorem.

Volume: Volume 10, Issue 1

Published on: February 18, 2014

Imported on: January 19, 2013

Keywords: Computer Science - Logic in Computer Science,Mathematics - Logic

Alessandro Cimatti;Luca Geatti;Nicola Gigante;Angelo Montanari;Stefano Tonetta, Lecture Notes in Computer Science, A first-order logic characterisation of safety and co-safety languages, pp. 244-263, 2022, 10.1007/978-3-030-99253-8_13, https://doi.org/10.1007/978-3-030-99253-8_13.

Alessandro Artale;Roman Kontchakov;Alisa Kovtunova;Vladislav Ryzhikov;Frank Wolter;et al., 2021, First-order rewritability of ontology-mediated queries in linear temporal logic, arXiv (Cornell University), 299, pp. 103536, 10.1016/j.artint.2021.103536, https://arxiv.org/abs/2004.07221.

Alexander Rabinovich, Lecture Notes in Computer Science, The Expressive Power of Temporal and First-Order Metric Logics, pp. 226-246, 2020, 10.1007/978-3-030-48006-6_16.

Daniel Oliveira;João Rasga, 2020, Revisiting separation: Algorithms and complexity, Logic journal of the IGPL (Print), 29, 3, pp. 251-302, 10.1093/jigpal/jzz081, https://doi.org/10.1093/jigpal/jzz081.

Vladislav Ryzhikov;Przemyslaw Andrzej Walega;Michael Zakharyaschev, Oxford University Research Archive (ORA) (University of Oxford), Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course, pp. 109-148, 2020, 10.1007/978-3-030-60067-9_5, https://ora.ox.ac.uk/objects/uuid:84c8d049-2a0b-42fb-b187-4f58fe5dd1c7.

Philippe Balbiani;Joseph Boudou;Martín Diéguez;David Fernández-Duque, 2019, Intuitionistic Linear Temporal Logics, 21, 2, pp. 1-32, 10.1145/3365833, https://hal.archives-ouvertes.fr/hal-02936422.

Dana Angluin;Dana Fisman, 2018, Regular omega-Languages with an Informative Right Congruence, arXiv (Cornell University), 277, pp. 265-279, 10.4204/eptcs.277.19.

Stephane Demri;Morgan Deters, 2016, Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction, ACM Transactions on Computational Logic, 17, 2, pp. 1-44, 10.1145/2835490, https://doi.org/10.1145/2835490.

Alexander Rabinovich, CiteSeer X (The Pennsylvania State University), On Almost Future Temporal Logics, pp. 261-272, 2015, 10.1007/978-3-319-23534-9_16, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.6220.

Sources : OpenCitations, OpenAlex & Crossref

This page has been seen 1223 times.

This article's PDF has been downloaded 381 times.