Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability

Details Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability

2010-03-04

arxiv.org/abs/1003.1057v1

Computer Science

Logic in Computer Science

Scientific paper

In [EGZ09] it has been shown that infinitary strong normalization (SNi) is
Pi-1-1-complete. Suprisingly, it turns out that infinitary weak normalization
(WNi) is a harder problem, being Pi-1-2-complete, and thereby strictly higher
in the analytical hierarchy.

Affiliated with

Also associated with

No associations

Rating

Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560261