Logic1109 - Generalized induction 0 1. 2. Generalized...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Generalized induction First we define a component relation between elements of an arbitrary set. C(x, y): x is a component of y. Ex1. The set N = {0, 1, 2, 3. …}, C(x, y) if x < y Ex2. The same set N, but now C(x, y) if x+1 =y. Ex3. The set A = {p, ~p, ~~p, ~~~p, …}, C(X, Y) if ~X = Y.
Background image of page 2
Descending chain is a finite sequence (x1, x2, …, xn) or an infinite sequence (x1, x2, …, xn, …) such that each term other than x1 is a component of the previous term. From the previous examples, (n, n-1, …, 2, 1, 0) and (~~~p, ~~p, ~p, p) are des- cending chains respectively. G In the first case if C(x, y) is defined to be x < y, you may skip some numbers.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
16.2 Suppose all descending chains are finite. Then it follows: an element x is not a component of itself. Otherwise, there is an infinite descending chain (x, x, …, x, x, … ). No two elements x and y are not compon- ents of each other. Otherwise, there is an infinite descending chain (x, y, x, y, …, x, y, … ).
Background image of page 4
16.3 The set N = {0, 1, 2, …} C(x, y) if x+1 =y (y is called the
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2010 for the course HSS Hss105 taught by Professor Yeelee during the Fall '09 term at Korea Advanced Institute of Science and Technology.

Page1 / 15

Logic1109 - Generalized induction 0 1. 2. Generalized...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online