연습장: 두 판 사이의 차이
| 65번째 줄: | 65번째 줄: | ||
(b)<br> | (b)<br> | ||
<math>(uv)w | |||
<math></math> | = (\{(i,x)|(i,x)\in u\} \cup | ||
\{(</math><math>|</math><math>u</math><math>|</math><math>+j,y)|(j,y)\in v\}) \cup | |||
\{(</math><math>|</math><math>uv</math><math>|</math><math>+k,z)|(k,z)\in v\}</math><br><math> | |||
= uvw | |||
= \{(i,x)|(i,x)\in u\} \cup | |||
\{(</math><math>|</math><math>u</math><math>|</math><math>+j,y)|(j,y)\in v\} \cup | |||
\{(</math><math>|</math><math>uv</math><math>|</math><math>+k,z)|(k,z)\in v\}</math><br><math> | |||
= u(vw) | |||
= \{(i,x)|(i,x)\in u\} \cup ( | |||
\{(</math><math>|</math><math>u</math><math>|</math><math>+j,y)|(j,y)\in v\} \cup | |||
\{(</math><math>|</math><math>uv</math><math>|</math><math>+k,z)|(k,z)\in v\})</math> | |||
<math></math> | <math></math> | ||
<math></math> | <math></math> | ||
2025년 9월 23일 (화) 05:09 판
Ex. 1
Existence)
Let be any string over an .
By the definition, the domain of is a finite initial segment of .
This means that s.t. w is defined at
Uniquness)
Suppose that s.t. both satisfy the condition for the string .
That means, w is defined at position if and only if .
By definition, and are both domain of , which means they are same set.
So the only way that and are same is their endpoints are same. Therefore, .
Hence, there exists a unique natural number with the desired property.
Ex. 2
Existence)
By definition, the domain of is the finite initial segment of .
If the domain is , then there is no position where the is defined.
In this situation, the length of the string is 0.
Hence, there is a string s.t. .
Uniquness)
Suppose that there is two sets s.t. .
Then are not defined at any index, so both are empty relation, subset of .
So are both empty, which means .
Hence, there is the a unique empty string s.t. , and we can define as the empty string
Ex. 3
Let be any string over an .
Existence)
By the definition of , is defined at any position i s.t. .
Therefore, if , then .
Uniquness)
By the definition of , relation is partial function.
So there is only one output when i is given s.t. .
Hence, For all strings and for all , if , then there exists a unique s.t. .
Ex. 4
Existence)
means that the domain of is .
So, let relation be , s.t. .
First, is a partial function, since for the input 1, there is only one output value.
Second, the domain of is , which is the finite initial segment of .
Hence, there is which satisfy given proposition.
Uniquness)
Suppose are string, and @@
Then, the domain of both string is , and the alphabet corresponding to index 0 is for both string.
Hence, .
Thus, for every , there exists a unique string s.t. and @.
Ex. 5
Ex. 6
(a)
Let .
By the definition,
In the same way,
(b)