Re: Enderton 3.4 Problem 1

The list of representable sets and relations in your lecture notes is intended to produce an intuition that decidable relations are representable. In fact, this is stated in slide 11. I don't have the precise definition of "decidable" in your course, but by that I mean relations that can be precisely described by algorithms. In fact, can be considered as a programming language and formulas as programs that return true or false. In fact, using Gödel numbers as codes and arithmetical formulas is a remnant from the 1930s, when Gödel's incompleteness theorems were proved. It is more convenient to consider logics dealing with more complicated programming datatypes, like lists and trees.

However, not all formulas can be executed because of quantifiers. A quantifier corresponds to a loop in conventional programming languages, and an unbounded quantifier is an infinite loop. A paradigmatic example of an unbounded loop is a formula defining the relation . This set is definable (in the sense of slide 10 of lecture 11) by the formula where represents the relation "y is the code of a derivation in of the formula with code x." But evaluating for each concrete n requires trying an unbounded number of y's.

If a formula has only bounded quantifiers, then there are two ways to evaluate it. The first is to find if it is true in : we know how to evaluate closed atomic formulas and , and bounded quantifiers require considering only a finite number of cases. The second way is to search for a derivation of either the formula itself or its negation in . If a formula has only bounded quantifiers, then it is numeralwise determined, so one of the derivation exists. For such formulas, these two ways of evaluation are equivalent.

The definition of a substitutable term can be described by an algorithm. This description does not appeal to infinite loops. It just says that the a variable in not in the scope of some quantifiers. This can be described in the language of arithmetical formulas, but the result would be very long.

Re: Enderton 3.4 Problem 1

Thank you for your explanation.

===============

Edit: SB1 is the corresponding function for the Sb1 relation such that

iff and iff

=============

My attempt is as follows:

(The necessary definitions for Sb and Fr can be found in the slides in the previous link.)

Case 1:

is an atomic formula:

.

Case 2: is substitutable for in iff it is substitutable for in .

If is the Gödel number of a wff then

Case 3: is substitutable for in iff it is substitutable for in both and .

If and are the Gödel numbers of a wff then

Case 4: is substitutable for in iff does not occur free in .

If is the Gödel number of a variable is the Gödel number of a wff then

and (item 7 in the slide 9).

The remaining part is to apply the characteristic function for Sb1.

Is this approach O.K ?

Thanks.

Re: Enderton 3.4 Problem 1

The name of the relation in the PDF file (slide 9, item 9) is Sbl, not Sb1.

Quote:

Originally Posted by

**logics** Case 1:

is an atomic formula:

.

is a function, not a relation. If you want the corresponding relation, you need four arguments. However, you need to define whether the term is substitutable, not the result of substitution. In fact, a term is always substitutable in an atomic formula.

Quote:

Originally Posted by

**logics** Case 2:

is substitutable for

in

iff it is substitutable for

in

.

If

is the Gödel number of a wff

then

SB1 is a characteristic function; it should return 0 or 1.

Quote:

Originally Posted by

**logics** Case 4:

is substitutable for

in

iff

does not occur free in

.

*No*. What's the use of substituting a term for a variable if the variable does not occur free? The result would be an identical formula. A term t is substitutable for a variable x if no variable *in t* is captured when x is replaced by t.

Note that you define SB1 by strong (or complete, or course-of-values) recursion, when the value at *a* may depend on the value at any number less than *a*. Strong recursion is expressible through regular primitive recursion and sequences, so it's not more powerful.

Re: Enderton 3.4 Problem 1

I have changed my previous post into the updated one using the characteristic function. Let f be the corresponding characteristic function for the relation Sbl.

Case 1:

f(a)=1 if a is the Gödel number of an atomic formula.

Case 2:

f(a)=1 if and f(i)=1].

Case 3:

f(a)=1 if and .

According to my textbook (Enderton page 113),

t is substitutable for x in iff either

(a) x does not occur free in (although it is of no use as you mentioned), or

(b) y does not occur in t and t is substitutable for x in .

I think I need to make Case 4 based on the above definition.

Is this approach O.K?

Thanks.

Re: Enderton 3.4 Problem 1