Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complexity and (un)decidability of fragments of ⟨ωωλ;×⟩\langle ω^{ω^λ}; \times \rangle

Published 4 Mar 2018 in cs.LO and math.LO | (1803.01418v2)

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 ⟨ωωλ;×,ω,ω+1,ω2+1⟩\langle \omega^{\omega^\lambda}; \times, \omega, \omega+1, \omega^2+1 \rangle for every ordinal λ\lambda. Moreover, we prove (by reduction from Hilbert Tenth Problem) that the ∃∗∀6\exists^*\forall^{6}-fragment of ⟨ωωλ;×⟩\langle \omega^{\omega^\lambda}; \times \rangle is undecidable for every ordinal λ\lambda.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.