Erratum to "Frequency Linear-time Temporal Logic"
Logic in Computer Science
2020-10-02 v1
Abstract
We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].
Cite
@article{arxiv.2010.00296,
title = {Erratum to "Frequency Linear-time Temporal Logic"},
author = {Benedikt Bollig and Normann Decker and Martin Leucker},
journal= {arXiv preprint arXiv:2010.00296},
year = {2020}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
LTL with Local and Remote Data Constraints
Ashwin Bhaskar
2022-06-06
Artificial Intelligence · Computer Science
Propositional Defeasible Logic has Linear Complexity
Michael J. Maher
2009-09-29
Logic in Computer Science · Computer Science
"Most of" leads to undecidability: Failure of adding frequencies to LTL
Bartosz Bednarczyk, Jakub Michaliszyn
2021-01-05
Logic in Computer Science · Computer Science
Intransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules
Vladimir Rybakov
2015-03-31
Logic in Computer Science · Computer Science
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
Vladimir Rybakov
2014-06-12
Logic in Computer Science · Computer Science
A Survey on Temporal Logics
Savas Konur
2013-08-06
Logic in Computer Science · Computer Science
On the Decidability and Complexity of Some Fragments of Metric Temporal Logic
Khushraj Madnani, Shankara Narayanan Krishna, Paritosh K. Pandya
2013-11-28
Logic in Computer Science · Computer Science
On Frequency LTL in Probabilistic Systems
Vojtěch Forejt, Jan Krčál
2015-06-29
Logic in Computer Science · Computer Science
Bounded Variability of Metric Temporal Logic
Carlo A. Furia, Paola Spoletini
2015-02-24
Logic · Mathematics
Rigidity is undecidable
Mikołaj Bojanczyk, Stanisław Szawiel, Marek Zawadowski
2019-02-20
Logic · Mathematics
Undecidability in Relevant Logic
Søren Brinck Knudstorp
2026-05-29
Logic in Computer Science · Computer Science
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
Catalin Dima, Ferucio Laurentiu Tiplea
2011-02-22
Logic in Computer Science · Computer Science
Bounded Reachability for Temporal Logic over Constraint Systems
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella +2
2010-04-21
Logic in Computer Science · Computer Science
Openness And Partial Adjacency In One Variable TPTL
Shankara Narayanan Krishna, Khushraj Madnani, Agnipratim Nag, Paritosh Pandya
2024-11-04
Logic in Computer Science · Computer Science
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2025-01-15
Logic in Computer Science · Computer Science
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
Ron van der Meyden, Manas K. Patra
2015-11-11
Logic in Computer Science · Computer Science
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract)
R van der Meyden, M K Patra
2016-06-29
Logic in Computer Science · Computer Science
On the decidability and complexity of Metric Temporal Logic over finite words
Joel Ouaknine, James Worrell
2017-01-11
Logic in Computer Science · Computer Science
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Ian Pratt-Hartmann
2024-04-24
Logic in Computer Science · Computer Science
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor
Amaldev Manuel, Thomas Schwentick, Thomas Zeume
2013-06-17
Logic in Computer Science · Computer Science
Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
Christopher Hampson, Agi Kurucz
2015-08-17
Logic in Computer Science · Computer Science
Decidability in the logic of subsequences and supersequences
Prateek Karandikar, Philippe Schnoebelen
2016-07-07
Logic in Computer Science · Computer Science
Generalizing Non-Punctuality for Timed Temporal Logic with Freeze Quantifiers
Shankara Narayanan Krishna, Khushraj Madnani, Manuel Mazo, Paritosh K. Pandya
2021-09-07
Logic in Computer Science · Computer Science
Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
Antoine Besset, Joris Tillet, Julien Alexandre dit Sandretto
2025-11-25
Quantum Physics · Physics
Erratum: Asymptotic entanglement manipulations can be genuinely irreversible. [Phys. Rev. Lett. {\bf 84}, 4260 (2000)]
Michal Horodecki, Pawel Horodecki, Ryszard Horodecki
2007-05-23