[FOM] Question About Church
urquhart at cs.toronto.edu
Sat Jun 15 09:44:27 EDT 2013
With a sufficiently rich vocabulary with numerical terms,
undecidability of coreference follows by standard methods.
However, this seems rather easy, so perhaps I am
misunderstanding Church's question.
On Fri, 14 Jun 2013, Harry Deutsch wrote:
> Dear Bill Greenberg, Yes. I think my remark that the word
> "non-synonymous" could be omitted was false, since if 'a' and 'b' are
> synonymous, then a=b and we know that 'a' and 'b' are co-referential.
> Church's question concerns specifically concurrent names that are not
> synonymous. However his last sentence is: " The difficulty lies in a
> method by which to determine in regard to each pair of primitive
> constants whether they are concurrent." Here it is "each pair of
> primitive constants" not just those that are not synonymous. What is
> the answer to Church's "open question?" Best, Harry On Jun 14, 2013, at
More information about the FOM