Concerning the Representability of Self-Reference in Arithmetic

Details Concerning the Representability of Self-Reference in Arithmetic Concerning the Representability of Self-Reference in Arithmetic

2011-09-05

arxiv.org/abs/1109.0949v2

Mathematics

Logic

Scientific paper

Terms in arithmetic of the form s in the formula s=t(< s >), with t a term with one free variable and < s > a numeral denoting the G\"odel number of s, are examined by writing the explicit definition of the encoding functions whose representation they include. This is first done with a specific encoding function and system of encoding and then examined more generally. The surprising result of each such construction, involving conventionally defined substitution or diagonalization functions and using conventional systems of encoding, is shown to be a non-terminating symbolic expression.

Affiliated with

Also associated with

No associations

Rating

Concerning the Representability of Self-Reference in Arithmetic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Concerning the Representability of Self-Reference in Arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concerning the Representability of Self-Reference in Arithmetic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450299