1. Forum
  2. Usenet
  3. SCI.LOGIC

  • Re: Tarski Undefinability and the correctly formalized Liar Paradox

    From Mikko@21:1/5 to olcott on Sun May 26 11:47:34 2024
    On 2024-05-25 15:27:22 +0000, olcott said:

    x ∉ True if and only if p
    where the symbol 'p' represents the whole sentence x https://liarparadox.org/Tarski_275_276.pdf

    First we convert the clumsy indirect approximation of
    self-reference by getting rid of the extraneous x we
    also swap the LHS with the RHS.
    p if and only if p ∉ True

    Note that this transformation is not proven to be truth preserving.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)