CS486 Problem Set 10
DUE: 4/24/03
- 1.
- We show how to express the following functions as -recursive
functions.
- (a)
-
Define
- (b)
-
Define
Define
Define
- (c)
-
Define
- 2.
- We show how to express the following functions in Peano arithmetic.
First, define
- (a)
-
Define
- (b)
-
Define
- (c)
-
Define
- 3.
- We prove
in Peano
arithmetic.
We first prove a useful lemma:
- lemma1:
- thm:
- 4.
- We show that the following laws are not valid in .
- (a)
-
- (b)
-
- (c)
-
- (d)
-
- (e)
-
Consider the following model of :
We show that the following laws are not valid in this model:
- (a)
-
- (b)
-
- (c)
-
- (d)
-
- (e)
-
We show that the axioms of are satisfied by this model:
- non-surjective:
- injective:
- nonzero:
- add-base:
- add-step:
- mul-base:
- mul-step:
- 5.
- The function
is defined recursively
as follows:
We show that is -recursive.
First, define the function
recursively as follows:
We note that the evaluation of only requires the evaluation
of where
and
.
Recall that
is the bijective
encoding of pairs of numbers, defined as
. Recall that
is the
selection function, which yields for
.
Define
We calculate .
We first prove the following:
-
Obvious from the definition of .
-
Proceed by induction on . Note by the definition
of . Note
by the
definition of . Suppose
for . Note
for .
-
Proceed by induction on . Note by the definition
of . Suppose for . Note
for .
-
Proceed by induction on . Note by the definition
of . Suppose
for . Note
for .
-
Proceed by induction on . Note by the definition
of . Suppose
for . Note
for .
Hence
Juanita Heyerman
2003-04-30