Related papers: Undecidability of a Theory of Strings, Linear Arit…
It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…
String geometry theory is one of the candidates of a non-perturbative formulation of string theory. In this theory, the ``classical'' action is almost uniquely determined by T-symmetry, which is a generalization of the T-duality, where the…
We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…
Starting from three-dimensional nonlinear elasticity under the restriction of incompressibility, we derive reduced models to capture the behavior of strings in response to external forces. Our $\Gamma$-convergence analysis of the…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference…
Evaluating theories in physics used to be easy. Our theories provided very distinct predictions. Experimental accuracy was so small that worrying about epistemological problems was not necessary. That is no longer the case. The…
We reinterpret N=(2,1) strings as describing the continuum limit of matrix theory with all spatial dimensions compactified. Thus they may characterize the full set of degrees of freedom needed to formulate the theory.
It is known that the verification of imperative, functional, and logic programs can be reduced to the satisfiability of constrained Horn clauses (CHCs), and this satisfiability check can be performed by using CHC solvers, such as Eldarica…
Nonperturbative effects in c<1 noncritical string theory are studied using the two-matrix model. Such effects are known to have the form fixed by the string equations but the numerical coefficients have not been known so far. Using the…
HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
We study algorithmic complexity and expressive power of fusion grammars, a novel formalism introduced in [Kreowski, Kuske, and Lye 2017], which extends hyperedge replacement grammars. In the first part of the work, we prove that the…
In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
We revisit the fermionic string theory on $AdS_3\times \mathcal{N}$ with $k=1$, and its single-trace $T\bar T$ deformation, with a focus on the $(2,2)$ superstring on (deformed) $AdS_3\times \mathbb{T}^3$. In a certain limit, it is dual to…
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m). We find algorithms solving mentioned…
Number theory is considered, by proposing quantum mechanical models and string-like models at zero and finite temperatures, where the factorization of number into prime numbers is viewed as the decay of particle into elementary particles…