Related papers: A Tenth Hilbert Problem-like Result: The Decidabil…
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…
We relate the decidability problem for BS with unordered cartesian product with Hilbert's Tenth problem and prove that BS with unordered cartesian product is NP-complete.
We introduce the Dichotomy Property, a new property of some languages in Set Computable Theory, in order to explore the expressivity of some languages which are extensions of MLS. By-product we prove undecidability of MLS extended with not…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…
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…
We prove an analogue of Hilbert's Tenth Problem for complex meromorphic functions. More precisely, we prove that the set of integers is positive existentially definable in fields of complex meromorphic functions in several variables over…
We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…
Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight.…
We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…
This paper considers linear quadratic team decision problems where the players in the team affect each other's information structure through their decisions. Whereas the stochastic version of the problem is well known to be complex with…
Motivated by the study of systems of higher order boundary value problems with functional boundary conditions, we discuss, by topological methods, the solvability of a fairly general class of systems of perturbed Hammerstein integral…
This paper explores undecidability in theories of positive characteristic function fields in the "geometric" language of rings $\mathcal{L}_F = \{0, 1, +, \cdot, F\}$, with a unary predicate $F$ for nonconstant elements. In particular we…
A convergent iterative process is constructed for solving any solvable linear equation in a Hilbert space.
Uncountably many mutually non-isomorphic product systems (that is, continuous tensor products of Hilbert spaces) of types II-0 and III are constructed by probabilistic means (random sets and off-white noises), answering four questions of W.…
It is known that the spatial product of two product systems is intrinsic. Here we extend this result by analyzing subsystems of the tensor product of product systems. A relation with cluster systems is established. In a special case, we…
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…