Related papers: The decision problem for normed spaces over any cl…

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

We give a non-perturbative proof that any 4D unitary and Lorentz-invariant quantum field theory with a conserved scale current is in fact conformally invariant. We show that any scale invariant theory (unitary or not) must have either a…

Dimensional reduction of generalized gravity theories or string theories generically yields dilaton fields in the lower-dimensional effective theory. Thus at the level of D=4 theories, and cosmology many models contain more than just one…

This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…

Decisions are often based on imprecise, uncertain or vague information. Likewise, the consequences of an action are often equally unpredictable, thus putting the decision maker into a twofold jeopardy. Assuming that the effects of an action…

We prove that Hilbert space is distortable and, in fact, arbitrarily distortable. This means that for all lambda >1 there exists an equivalent norm |.| on l_2 such that for all infinite dimensional subspaces Y of l_2 there exist x,y in Y…

We consider a generalized Baernstein space associated to a compact family of finite subsets of an uncountable set. We show that for certain transfinitely defined families such spaces admit an equivalent $2$-rotund norm. We also show that…

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

Using the reduced formulation of large-N Quantum Field Theories we study strings in space-time dimensions higher than one. Some preliminary results concerning the possible string susceptibilities and general properties of the model are…

For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…

In our work we investigate quotient structures and quotient spaces of a space of orderings arising from subgroups of index two. We provide necessary and sufficient conditions for a quotient structure to be a quotient space that, among other…

We are going to prove that if the theory of a structure $\mathcal M=\langle \mathbb{N}, \Sigma \rangle$ is decidable and the standard order $<$ on natural numbers $\mathbb{N}$ is definable in $\mathcal M$, then there is a nontrivial…

Second-order self-force computations, which will be essential in modeling extreme-mass-ratio inspirals, involve two major new difficulties that were not present at first order. One is the problem of large scales, discussed in [Phys. Rev. D…

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…