Decidable extensions of church's problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationComputer Science Logic - 23rd International Workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings
Pages424-439
Number of pages16
DOIs
StatePublished - 2009
Event23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL - Coimbra, Portugal
Duration: 7 Sep 200911 Sep 2009

Publication series

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

Conference

Conference23rd International Workshop on Computer Science Logic, CSL 2009 - 18th Annual Conference of the EACSL
Country/TerritoryPortugal
CityCoimbra
Period7/09/0911/09/09

Fingerprint

Dive into the research topics of 'Decidable extensions of church's problem'. Together they form a unique fingerprint.

Cite this