8 citations · 15 across the 14 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2014
The existential fragment of S1S over element and successor is the co-Buchi languages
Egor Ianovski
Buchi's theorem, in establishing the equivalence between languages definable in S1S over element and < and the omega-regular languages also demonstrated that S1S over element and <…
cs.FL2013★ 2 cited
Computable Component-wise Reducibility
Egor Ianovski
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in…