Erratum to "Frequency Linear-time Temporal Logic"

10/01/2020
by   Benedikt Bollig, et al.
0

We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/09/2017

A Proof of Stavi's Theorem

Kamp's theorem established the expressive equivalence of the temporal lo...
02/26/2019

A New Linear Time Correctness Condition for Multiplicative Linear Logic

In this paper, we give a new linear time correctness condition for proof...
09/13/2021

The inverse of Ackermann function is computable in linear time

We propose a detailed proof of the fact that the inverse of Ackermann fu...
12/25/2020

Standard Grammars for LTL and LDL (v0.1.0)

The heterogeneity of tools that support temporal logic formulae poses se...
01/24/2021

A greedy algorithm for dropping digits (Functional Pearl)

Consider the puzzle: given a number, remove k digits such that the resul...
02/01/2019

Adventures in Monitorability: From Branching to Linear Time and Back Again

This paper establishes a comprehensive theory of runtime monitorability ...
11/04/2020

PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inappr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.