Related papers: Undecidability of a Theory of Strings, Linear Arit…
String theory on $AdS_3$ has a solvable single-trace irrelevant deformation that is closely related to $T\bar T$. For one sign of the coupling, it leads to an asymptotically linear dilaton spacetime, and a corresponding Hagedorn spectrum.…
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…
Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures are employed to estimate the repetitiveness of…
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…
We propose a novel string theory propagating in a non-commutative deformation of the four dimensional space T* T^2 whose scattering states correspond to superconformal theories in 5 dimensions and the scattering amplitudes compute…
String theory avoids the ultraviolet infinities that arise in trying to quantize gravity. It is also more predictive than conventional quantum field theory, one aspect of this being the way that it contributed to the emergence of the…
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…
We propose a non-perturbative definition for refined topological strings. This can be used to compute the partition function of superconformal theories in 5 dimensions on squashed S^5 and the superconformal index of a large number of 6…
We discuss dark energy, dark matter and the hierarchy problem in the context of a general non-commutative formulation of string theory. In this framework dark energy is generated by the dynamical geometry of the dual spacetime while dark…
Tree transductions are binary relations of finite trees. For tree transductions defined by non-deterministic top-down tree transducers, inclusion, equivalence and synthesis problems are known to be undecidable. Adding origin semantics to…
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
There are at present two known string theories in $(2,2)$ dimensions. One of them is the well known $N=2$ string, and the other one is a more recently constructed $N=1$ spacetime supersymmetric string. They are both based on certain…
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and…
Even at tree level, the first quantized string theory suffers from apparent short distance singularities associated with collision of vertex operators that prevent us from straightforward numerical computation of various quantities.…
Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem.…
The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
We demonstrate that string consistency in four spacetime dimensions leads to a spectrum of string states which satisfies the supertrace constraints Str(M^0)=0 and Str(M^2)=\Lambda at tree level, where \Lambda is the one-loop string…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…