The Church Synthesis Problem with Parameters

Details The Church Synthesis Problem with Parameters The Church Synthesis Problem with Parameters

2007-08-26

arxiv.org/abs/0708.3477v2

LMCS 3 (4:9) 2007

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-3(4:9)2007

For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y=F(X) such that ψ(X,F(X)) is universally valid over Nat. B\"{u}chi and Landweber proved that the Church synthesis problem is decidable; moreover, they showed that if there is an operator F that solves the Church Synthesis Problem, then it can also be solved by an operator defined by a finite state automaton or equivalently by an MLO formula. We investigate a parameterized version of the Church synthesis problem. In this version ψ might contain as a parameter a unary predicate P. We show that the Church synthesis problem for P is computable if and only if the monadic theory of is decidable. We prove that the B\"{u}chi-Landweber theorem can be extended only to ultimately periodic parameters. However, the MLO-definability part of the B\"{u}chi-Landweber theorem holds for the parameterized version of the Church synthesis problem.

Affiliated with

Also associated with

No associations

Rating

The Church Synthesis Problem with Parameters 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 The Church Synthesis Problem with Parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Church Synthesis Problem with Parameters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599936