Related papers: Erratum to "Frequency Linear-time Temporal Logic"
We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval temporal logic depending on the type (box or diamond) of the interval modal operators, the type of the underlying linear order (discrete or dense),…
Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties have been proposed, and there is a need to understand their…
Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…
This note points out a gap in the proof of the main theorem of the article "Birationally rigid hypersurfaces" published in Invent. Math. 192 (2013), 533-566, and provides a new proof of the theorem.
For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…
For real symmetric positive definite matrices $A$ and $B$, we characterize when a function $f \in L^2(\mathbb{R}^d)$ satisfies \[ |f(x)| \lesssim e^{-(\frac12 - \lambda) \langle Ax, x\rangle} \quad \text{and} \quad |\widehat{f}(\xi)|…
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem…
LTL is frequently used to express specifications in many domains such as embedded systems or business processes. Witnesses can help to understand why an LTL specification is satisfiable, and a number of approaches exist to make…
We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…
We give a short review of known exact inequalities that can be interpreted as "energy-time" and "frequency-time" uncertainty relations. In particular we discuss a precise form of signals minimizing the physical frequency-time uncertainty…
We give a purely logical proof of the J. Conway and S. Kochen Free Will theorem concerning undeterminacy in Quantum Mechanics (Notices of the AMS, February 2009, Vol. 56/2, p. 226). The logical method seems to be very powerful.
An error occurs in a part of the statement and proof of Proposition 2.2 in Jour. Math. Anal. and Appl., 476, (2019), 53-85 that is corrected in this erratum. The revised result reveals a new and unexpected critical phenomenon, having…
Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point…
We correct a partial mistake for a metric presented in the article "Lattice constellation and codes from quadratic number fields" [IEEE Trans. Inform. Theory, vol. 47, No. 4, May. 2001]. We show that the metric defined in the article is not…
This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes.…
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
Erratum to "From Uncertainty Principles to Wegner Estimates".
Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time…