Arrow Research search
Back to Highlights

Highlights 2019

Uniformization of MSO-definable relation on integers

Conference Abstract Session 9: REGULARITY Logic in Computer Science · Theoretical Computer Science

Abstract

We consider the problem to decide, whether a given MSO-definable relation R of the bi-infinite words (words over integers), there exist a MSO-definable function F (a functional relation between bi-infinite words) which uniformize it (meaning that if x R y then also x R f(x)). We argue that this problem is decidable.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
673710376119629403
v2026.09.13