49 search results - page 1 / 10 » Logical Refinements of Church's Problem |
CSL
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
FSTTCS
2009
Springer
13 years 8 months ago
2009
Springer
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
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) ...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
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)) ...