[FOM] A Question

[Arnon Avron]

On Tue, Jun 09, 2009 at 03:55:34PM -0500, hdeutsch at ilstu.edu wrote:
> Let L be a language capable of expressing its own syntax.  Add to L a  
> two place predicate 'impl' satisfying
> 
> (1) impl ([A], [B]) < - > (A - > B),

Had this been possible, you could have defined true(x) 
as impl([0=0],x), contradicting Tarski's theorem 
about the undefinability of the truth predicate.

Arnon Avron