Emergent Mind
Complexity and (un)decidability of fragments of $\langle ω^{ω^λ}; \times \rangle$
(1803.01418)
Published Mar 4, 2018
in
cs.LO
and
math.LO
Abstract
We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega{\omega\lambda}; \times, \omega, \omega+1, \omega2+1 \rangle$ for every ordinal $\lambda$. Moreover, we prove (by reduction from Hilbert Tenth Problem) that the $\exists*\forall{6}$-fragment of $\langle \omega{\omega\lambda}; \times \rangle$ is undecidable for every ordinal $\lambda$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.