相关论文: Bounded ACh Unification
In this paper we provide a (negative) solution to a problem posed by Stanis{\l}aw Krajewski. Consider a recursively enumerable theory U and a finite expansion of the signature of U that contains at least one predicate symbol of arity $\ge$…
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…
We prove existence and regularity for the solutions to a Cahn-Hilliard system describing the phenomenon of phase separation for a material contained in a bounded and regular domain. Since the first equation of the system is perturbed by the…
The unified product was defined in \cite{am3} related to the restricted extending structure problem for Hopf algebras: a Hopf algebra $E$ factorizes through a Hopf subalgebra $A$ and a subcoalgebra $H$ such that $1\in H$ if and only if $E$…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
We deal with the periodic boundary value problem associated with the parameter-dependent second-order nonlinear differential equation \begin{equation*} u'' + cu' + \bigr{(} \lambda a^{+}(x) - \mu a^{-}(x) \bigr{)} g(u) = 0, \end{equation*}…
In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
We introduce a general systematic procedure for solving any binary-input binary-output game using operator algebraic techniques on the representation theory for the underlying group, which we then illustrate on the prominent class of tilted…
A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…
The method is proposed for the study of many-point boundary value problems for systems of nonlinear ODE, by reducing them to special equivalent integral equations, and allows us [in contrast with the known method [1]] to consider boundary…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
We extend the theoretical framework of non-local optimized Schwarz methods as introduced in [Claeys,2021], considering an Helmholtz equation posed in a bounded cavity supplemented with a variety of conditions modeling material boundaries.…
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…