Related papers: A Tenth Hilbert Problem-like Result: The Decidabil…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
We show that the matrix (or more generally tensor) product states in a finite translation invariant system can be accurately constructed from the same set of local matrices (or tensors) that are determined from an infinite lattice system in…
This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from $1\frac{1}{2}$-player games with PCTL winning objectives, we establish that the PCTL satisfiability problem is…
In this paper we complete B\"{u}chi's proof that there is no decision algorithm for the solubility in integers of arbitrary systems of diagonal quadratic form equations, by proving the assertion that whenever $x_1^2, \cdots, x_5^2$ are five…
An example is given of a compact absolute retract that is not a Hilbert cube manifold but whose second symmetric porduct is the Hilbert cube. A factor theorem is given for nth symmetric product of the cartesian product of any absolute…
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…
Coupled nonlinear integrable systems are generated from usual zero curvature equation. The relevant Maurer-Cartan forms are constructed by combining suitably chosen matrices (nilpotent, Hadamard, idempotent and k-idempotent) and Lie…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…
Focusing on stochastic finite-action mechanisms, we study implementation in undominated strategies and iteratively undominated strategies. We establish both possibility and impossibility results that resolve the open question in B\"orgers…
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 extend the well-known L-Shaped method to solve two-stage stochastic programming problems with decision-dependent uncertainty. The method is based on a novel, unifying, formulation and on distribution-specific optimality and…
We position Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain kind must solve the halting problem for all programs of that…
This note concerns a class of matrix Riccati equations associated with stochastic linear-quadratic optimal control problems with indefinite state and control weighting costs. A novel sufficient condition of solvability of such equations is…
Inspired by the theory of desirable gambles that is used to model uncertainty in the field of imprecise probabilities, I present a theory of desirable things. Its aim is to model a subject's beliefs about which things are desirable. What…
Let K be a field with a valuation satisfying the following conditions: both K and the residue field k have characteristic zero; the value group is not 2-divisible; there exists a maximal subfield F in the valuation ring such that…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Given a closed manifold of positive Yamabe invariant and for instance positive Morse functions upon it, the conformally prescribed scalar curvature problem raises the question, whether or not such functions can by conformally changing the…
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…