Related papers: Undecidability of a Theory of Strings, Linear Arit…
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…
This is a broad-brush review of how string theory addresses several important questions of gravitational physics. The problem of non-renormalizability is first reviewed, followed by introduction of string theory as an ultraviolet-finite…
String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting (XSS). A popular string analysis technique includes symbolic…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…
A brief review of the status of duality symmetries in string theory is presented. The evidence is accumulating rapidly that an enormous group of duality symmetries, including perturbative T dualities and non-perturbative S-dualities,…
String theory is the most promising candidate for the theory unifying all interactions including gravity. It has an extremely difficult dynamics. Therefore, it is useful to study some its simplifications. One of them is non-critical string…
Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive enough. In the semantics of TSL, functions and predicates…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Strings are widely used in programs, especially in web applications. Integer data type occurs naturally in string-manipulating programs, and is frequently used to refer to lengths of, or positions in, strings. Analysis and testing of…
String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have…
Currently, string theory represents the only advanced approach to a unification of all interactions, including gravity. In spite of the more than thirty years of its existence it did not make any empirically testable predictions. And it is…
Is string theory uniquely determined by self-consistency? Causality and unitarity seemingly permit a multitude of putative deformations, at least at the level of two-to-two scattering. Motivated by this question, we initiate a systematic…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
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…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…