arXiv Analytics

Sign in

arXiv:1611.00439 [math.LO]AbstractReferencesReviewsResources

Paradox with just self-reference

T. Parent

Published 2016-11-02Version 1

If a semantically open language allows self-reference, one can show there is a predicate which is both satisfied and unsatisfied by a self-referring term. The argument amounts to diagonalization on substitution instances of a definition-scheme for the predicate 'x is Lagadonian.' (The term 'Lagadonian' is adapted from David Lewis). Briefly, a self-referring term is counted as "Lagadonian" if the initial variable in the schema is replaced with the term itself. But the same term is not counted as Lagadonian if this variable is replaced with the quotation or other name for the term. Thus the term both satisfies and does not satisfy 'x is Lagadonian'.

Related articles: Most relevant | Search more
arXiv:1109.0949 [math.LO] (Published 2011-09-05, updated 2012-01-27)
Concerning the Representability of Self-Reference in Arithmetic
arXiv:2207.07397 [math.LO] (Published 2022-07-15)
First-order logic with self-reference
arXiv:1006.0992 [math.LO] (Published 2010-06-04)
From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference