Decidable extensions of church's problem

Alexander Rabinovich

doi:10.1007/978-3-642-04027-6_31

Decidable extensions of church's problem

Alexander Rabinovich

School of Computer Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X,F(X)) is universally valid over Nat. Büchi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended version a formula B and a finite-state operator F might contain as a parameter a unary predicate P. A large class of predicates P is exhibited such that the Church problem with the parameter P is decidable. Our proofs use Composition Method and game theoretical techniques.

Original language	English
Title of host publication	Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings
Pages	424-439
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-04027-6_31
State	Published - 2009
Event	23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL - Coimbra, Portugal Duration: 7 Sep 2009 → 11 Sep 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5771 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL
Country/Territory	Portugal
City	Coimbra
Period	7/09/09 → 11/09/09

Access to Document

10.1007/978-3-642-04027-6_31

Cite this

Rabinovich, A. (2009). Decidable extensions of church's problem. In Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings (pp. 424-439). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5771 LNCS). https://doi.org/10.1007/978-3-642-04027-6_31

@inproceedings{608efb3ac2334e00bc54fc0f546bee75,

title = "Decidable extensions of church's problem",

abstract = "For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X,F(X)) is universally valid over Nat. B{\"u}chi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended version a formula B and a finite-state operator F might contain as a parameter a unary predicate P. A large class of predicates P is exhibited such that the Church problem with the parameter P is decidable. Our proofs use Composition Method and game theoretical techniques.",

author = "Alexander Rabinovich",

year = "2009",

doi = "10.1007/978-3-642-04027-6_31",

language = "אנגלית",

isbn = "3642040268",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "424--439",

booktitle = "Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings",

note = "null ; Conference date: 07-09-2009 Through 11-09-2009",

}

Rabinovich, A 2009, Decidable extensions of church's problem. in Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5771 LNCS, pp. 424-439, 23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL, Coimbra, Portugal, 7/09/09. https://doi.org/10.1007/978-3-642-04027-6_31

Decidable extensions of church's problem. / Rabinovich, Alexander.

Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings. 2009. p. 424-439 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5771 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Decidable extensions of church's problem

AU - Rabinovich, Alexander

PY - 2009

Y1 - 2009

N2 - For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X,F(X)) is universally valid over Nat. Büchi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended version a formula B and a finite-state operator F might contain as a parameter a unary predicate P. A large class of predicates P is exhibited such that the Church problem with the parameter P is decidable. Our proofs use Composition Method and game theoretical techniques.

AB - For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X,F(X)) is universally valid over Nat. Büchi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended version a formula B and a finite-state operator F might contain as a parameter a unary predicate P. A large class of predicates P is exhibited such that the Church problem with the parameter P is decidable. Our proofs use Composition Method and game theoretical techniques.

UR - http://www.scopus.com/inward/record.url?scp=70350357367&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04027-6_31

DO - 10.1007/978-3-642-04027-6_31

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70350357367

SN - 3642040268

SN - 9783642040269

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 424

EP - 439

BT - Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings

Y2 - 7 September 2009 through 11 September 2009

ER -

Rabinovich A. Decidable extensions of church's problem. In Computer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings. 2009. p. 424-439. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-04027-6_31

Decidable extensions of church's problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this