Beruflich Dokumente
Kultur Dokumente
. e
1 . e
, :
1) , , 2 .
2) ,
, .
3)
.
,
, . . ,
1
, : -, ,
Principia Mathematica
I; , , ,
.
,
.
.
e ( : );
.
e (: ).
2
: ,
() () (
E),
() . , .
(c)
37
Analytica, 3, 2009
e , e , . , , ,
.
,
.
4) ( ) . , ,
e
, , : , . ,
, . . , ,
e ,
.
5)
,
.
6)
,
.
:
I.
Principia Mathematica
I, 3 ()
3
e:
, . , . , ,
,
e
: G
odel K. Uber
formal unentscheidbare S
atze der Principipa Mathematica und
verwandter System I. In: Monatshefte f
ur Mathematik und Physik, 38. 1931, pp. 173
198, ,
(c)
38
Analytica, 3, 2009
. e .
II. , e ,
, . ,
1) ;
2)
;
3) ;
4) ;
5)
;
6) .
III. , ,
.
I
Principia
Mathematica I . e 4 :
:
VI.
r, , Gen r, N eg( Gen r)
F lg() (
r ).
, , : G
odel K. On formally undecidable
propositions of Principia Mathematica and related systems I. In: Frege and G
odel:
Two Fundamental Texts in Mathematical Logic. Cambridge, Massachusetts, 1970,
pp. 87107.
4
G
odel K. On formally undecidable propositions of Principia Mathematica and
related systems I. In: Frege and G
odel: Two Fundamental Texts in Mathematical Logic.
Cambridge, Massachusetts, 1970, pp. 98100.
(c)
39
Analytica, 3, 2009
.
.
Bw (x) (n) [n 5 l(x) Ax(n Gl x) (n Gl x)
(Ep, q){0 < p, q < n & F l(n Gl x, p Gl x, q Gl x)}] &
& l(x) > 0
(5)
(. 44),
x B y Bw (x) & [l(x)] Gl x = y
Bew (x) (Ey)y B x
(6)
(6.1)
(. 45 46).
, ,
(x)[Bew (x) x F lg()]
(7)
(8)
19 )].
Q(x, y) x B [Sb(yZ(y)
(8.1)
19
x B y ( (6) (5)) Sb(yZ(y)
) ( 17 31) ,
Q(x, y). , V
(8), q ( 17 19), ,
19 )] Bew [Sb(q 17
x B [Sb(yZ(y)
Z(x)
19
Z(y) )]
(9)
17
19
)] Bew [N eg (Sb(qZ(x)
x B [Sb(yZ(y)
19
Z(y) ))].
(10)
p = 17 Gen q
(c)
40
(11)
Analytica, 3, 2009
(p 19)
19
r = Sb(qZ(p)
)
(12)
(r 5
17).
19
Sb(p19
Z(p) ) = Sb([17 Gen q]Z(p) ) =
19
= 17 Gen Sb(qZ(p)
) = 17 Gen r
(13)
( (11) (12));6
17
Sb(qZ(x)
19
Z(p) )
17
= Sb(rZ(x)
)
(14)
( (12)). p y (9)
(10) (13) (14),
17
x B (17 Gen r) Bew [Sb(rZ(x)
)],
(15)
17
x B (17 Gen r) Bew [N eg (Sb(rZ(x)
))].
(16)
:
1. 17 Gen r .7
, n, n B (17 Gen r). , (16)
17
Bew [N eg (Sb(rZ(n)
))], ,
17
, 17 Gen r Sb(rZ(n)
).
, (, ,
).
2. N eg(17 Gen r) . : , 17 Gen r
5
[ 43 Ibid., p. 99. . .] r
q
p. [
( , ), , :
p.]
6
[ 44 Ibid. . .] Gen Sb
, .
7
[ 45 Ibid. . .] x
x F lg(), , (7), , Bew (x).
(c)
41
Analytica, 3, 2009
, (
) () () R(x1 , . . . , xn )
[entscheidungsdenit], n r, ,
8
Ibid., p. 100.
[ 45a Ibid. . .] ,
, V, , ,
.
9
(c)
42
Analytica, 3, 2009
43
Analytica, 3, 2009
[(
, r recursive() &
( Gen r) F lg()
)
& recursive(r)
]
& (N eg( Gen r)) F lg() .
consist()
, , , e
. e e.
2. :
.
.
:
1)
. ,
.
e , ,
, ;
2) .
. e
, :
recursive{}. . , .
3) .
.
: consist{}.
, . .
10 :
,
a, ,
(n)[Sb(aZ(n) ) F lg()] & [N eg( Gen a)] F lg(),
10
Ibid., p. 98.
(c)
44
Analytica, 3, 2009
a.
, , e .
:
consist{}
(
)
a n[Sb(aZ(n) ) F lg()] & [N eg( Gen a)] F lg() .
,
, consist{} .
3. e :
Bw (x) (n) [n 5 l(x) Ax(n Gl x) (n Gl x)
(Ep, q){0 < p, q < n & F l(n Gl x, p Gl x, q Gl x)}] &
& l(x) > 0
(5)
(. 44),
(5)
e . e
e 4411 .
:
44.
4. :
x B y Bw (x) & [l(x)] Gl x = y
Bew (x) (Ey)y B x
(6)
(6.1)
(. 45 46).
11
45 ,
e
e
2 .
(c)
45
Analytica, 3, 2009
(6) (6.1) .
:
45 46 (6) (6.1).
5. :
, ,
(x)[Bew (x) x F lg()]
(7)
(8)
(7) (8)
. (7) . ,
(8) , . (7) x :
Bew (x) x F lg(),
consist{}
(
)
a n[Sb(aZ(n) ) F lg()] & [N eg( Gen a)] F lg() ,
: Sb(aZ(n) ) F lg()
N eg( Gen a) F lg(),
. (7)
x, :
Sb(aZ(n) ) F lg() Bew (Sb(aZ(n) )),
:
N eg( Gen a) F lg() Bew (N eg( Gen a)).
8 9 . : ., 7
x, : x = Sb(aZ(n) ) (
) x = N eg( Gen a) ( ).
(c)
46
Analytica, 3, 2009
,
,
e , , 12 .
consist ,
. :
consist{}
(
)
a n[Bew (Sb(aZ(n) ))] & Bew (N eg( Gen a)) .
consist
.
, :
( ),
, 8 9.
(8).
(7) (8), 7 11
, e ;
, , , .
: 13 .
12
., , 5 . . .
., 2005, . 30.
13
. (8), , . , x[Bew(x)
Bew (x)], x[Bew(x) Bew(, x)],
x, [Bew(x) Bew(, x)] , ,
x[Bew(x) Bew(, x)], . Bew(x)
Bew(, x), , , . (7), ,
, ( ),
.
x F lg().
(c)
47
Analytica, 3, 2009
6. :
19 )].
Q(x, y) x B [Sb(yZ(y)
(8.1)
(8.1) , .
. (8.1) ,
.
e .
e
(). . ,
14 ,
(7) (8).
14
, , .
,
17 Gen r [. . .] []
VI.
Guidi Fr. La proposizione di G
odel,
California, 2007. pp. 7677, 73, 17 Gen r
(8.1). , :
La formula eettiva, costruita nell immagine isomorfa di PM, sara
19 )]: x non
17 Gen r, ottenuta dalla relazione Q(x, y) x B [Sb(yZ(y)
`
e il numero di G
odel di una dimostrazione della formula indicata con
19 )]. Quest ultima espressione viene a designare, nell ambito
[Sb(yZ(y)
del calcolo aritmetico formalizzato: il numero di G
odel della formula
generata dalla formula che ha numero di G
odel y, sostituendo nella
variabile libera con numero 19, il numerale di y.
:
[] , PM, 17 Gen r, Q(x, y)
19 )]: x
x B [Sb(yZ(y)
e
19 )]. , [Sb(yZ(y)
:
(c)
48
Analytica, 3, 2009
e, , :
1) ;
2) Q(x, y).
() , :
1) Q(x, y);
2) .
, (8.1)
Q(x, y) . : , .
7. :
19
x B y ( (6) (5)) Sb(yZ(y)
) (
17 31) ,
Q(x, y).
, Q(x, y) ,
19 )].
x B [Sb(yZ(y)
,
.
1) x B y , : recursive(x B y).
.
(6) ( 5)
x B y;
. II15 ,
, e
. [l(x)] Gl x = y, . .
. III16 ,
. , [l(x)] Gl x,
e , ,
e y,
19 y. .
15
16
G
odel K. Op. cit., p. 93.
Ibid.
(c)
49
Analytica, 3, 2009
617 . , y, .
, [l(x)] Gl x = y, . . ,
. Bw (x), (5),
4. Bw (x)
.
, II, x B y
.
2) Z(y) , : recursive(Z(y)).
, Z(y)
1718 .
3) Sb(yxz ) , : recursive(Sb(yxz )).
Sb(yxz ) 3119 .
19
19
4) Sb(yZ(y)
) , : recursive(Sb(yZ(y)
)).
19
Sb(yZ(y) ) I20 ,
Sb(yxz ) Z(y) x,
z 19 ( ).
19
)] , :
5) x B [Sb(yZ(y)
19
)]).
recursive(x B [Sb(yZ(y)
19
x B [Sb(yZ(y) )] I, x B y
19
Sb(yZ(y)
) y.
6)
19 )]
x B [Sb(yZ(y)
19 )]).
recursive(x B [Sb(yZ(y)
19 )] x B [Sb(yZ(y)
19
II, x B [Sb(yZ(y)
)]
.
,
19 )] , , x B [Sb(yZ(y)
, , , ,
17
Ibid., p. 95.
Ibid.
19
Ibid., p. 96.
20
Ibid., p. 93.
18
(c)
50
Analytica, 3, 2009
19
19 )] Bew [Sb(q 17
x B [Sb(yZ(y)
(9)
Z(x) Z(y) )]
19
17
x B [Sb(yZ(y)
)] Bew [N eg (Sb(qZ(x)
19
Z(y) ))].
(10)
: 1) V recursive(Q(x, y)), 2)
(8), 11.
,
.
. V 21 :
V.
R(x1 , . . . , xn ) n
r ( u1 , . . . , un ), , n (x1 , . . . , xn )
u1
R(x1 , . . . , xn ) Bew[Sb(rZ(x
1)
... un
... Z(xn ) )],
u1
R(x1 , . . . , xn ) Bew[N eg(Sb(rZ(x
1)
... un
... Z(xn ) ))].
:
(
(
)
R(x1 , . . . , xn ) recursive R(x1 , . . . , xn )
{(
u1
r(u1 , . . . , un ), x1 , . . . ,xn R(x1 , . . . , xn ) Bew[Sb(rZ(x
1)
(
u1
R(x1 , . . . , xn ) Bew[N eg(Sb(rZ(x
1)
21
... un
... Z(xn ) )]
&
)})
.
... un
... Z(xn ) ))]
(c)
51
Analytica, 3, 2009
, , , , V .
. ,
. . R(x1 , . . . , xn ), x1 = (x2 , . . . , xn ),
. .
, 1, . . x + 1. . , m.
1 , . . . , k . r1 , . . . , rk , ,
(3) (4). r
r1 , . . . , rk , (3)
(4). ( . . .)
V,
, .
, ,
: R(x1 , . . . , xn ) r, (3) (4).
. V, ,
,
R(x1 , . . . , xn ) r(u1 , . . . , un ):
(
(
)
R(x1 , . . . , xn ) recursive R(x1 , . . . , xn )
(
r(u1 , . . . , un ) R(x1 , . . . , xn ) r(u1 , . . . , un ) &
{(
)
u1
... un
x1 , . . . , xn R(x1 , . . . , xn ) Bew[Sb(rZ(x
)] &
1 ) ... Z(xn )
(
)}))
u1
... un
R(x1 , . . . , xn ) Bew[N eg(Sb(rZ(x
))]
.
1 ) ... Z(xn )
21 V.
Q(x, y),
(c)
52
Analytica, 3, 2009
R(x1 , . . . , xn ).
(22 , : , 21):
(
)
recursive (Q(x, y))
q(u1 , u2 ) Q(x, y) q(u1 , u2 ) &
{(
)
u1
u2
x, y Q(x, y) Bew[Sb(qZ(x)
Z(y) )] &
(
)})
u1
u2
Q(x, y) Bew[N eg(Sb(qZ(x)
))]
.
Z(y)
(
)
20 recursive Q(x, y) . ( 23 : modus
ponens, 22, 20):
(
q(u1 , u2 ) Q(x, y) q(u1 , u2 ) &
{(
)
u1
u2
x, y Q(x, y) Bew[Sb(qZ(x)
Z(y) )] &
(
)})
u1
u2
Q(x, y) Bew[N eg(Sb(qZ(x)
.
Z(y) ))]
.
Q(x, y)
q(17, 19), . . Q(x, y) q(17, 19). Q(x, y) q(17, 19) Q(x, y)
q(17, 19).
24 .
, , 23, Q(x, y) q(17, 19).
, .
?
22 :
, [. . .], ,
. .:
recursive(r) recursive(R) & R r,
22
Ibid., p. 98.
(c)
53
Analytica, 3, 2009
.
25
.
26 q(17, 19) r,
Q(x, y) R, 25.
recursive(q(17, 19)) recursive(Q(x, y)) & Q(x, y) q(17, 19).
, , q(17, 19) .
26
( 27, , 26):
recursive(Q(x, y)) & Q(x, y) q(17, 19) recursive(q(17, 19)).
54
Analytica, 3, 2009
, :
(
)
17
19
Q(x, y) Bew[Sb(qZ(x)
Z(y) )] &
(
)
17
19
Q(x, y) Bew[N eg(Sb(qZ(x)
Z(y) ))] .
32 , 31.
33 34 ,
&:
17
Q(x, y) Bew[Sb(qZ(x)
19
Z(y) )]
17
Q(x, y) Bew[N eg(Sb(qZ(x)
19
Z(y) ))].
,
. . V recursive(Q(x, y)).
. (8)
11:
x[Bew(x) Bew (x)].
. 17
19
x Sb(qZ(x)
Z(y) ),
17
19
N eg(Sb(qZ(x) Z(y) )). :
17
Bew[Sb(qZ(x)
19
Z(y) )]
17
Bew [Sb(qZ(x)
19
Z(y) )]
17
Bew[N eg(Sb(qZ(x)
19
Z(y) ))]
17
Bew [N eg(Sb(qZ(x)
19
Z(y) ))].
35 36 , 11.
, e 33
34 35 36, ,
, :
17
Q(x, y) Bew [Sb(qZ(x)
19
Z(y) )]
17
Q(x, y) Bew [N eg(Sb(qZ(x)
19
Z(y) ))].
(c)
55
Analytica, 3, 2009
37 38.
, . . (8) .
:
19 )] Bew [Sb(q 17
x B [Sb(yZ(y)
Z(x)
19
Z(y) )]
19
17
x B [Sb(yZ(y)
)] Bew [N eg (Sb(qZ(x)
19
Z(y) ))],
. ,
, ;
(8.1), 12, . .
19 )]. :
Q(x, y) x B [Sb(yZ(y)
19 )] Bew [Sb(q 17
x B [Sb(yZ(y)
Z(x)
19
Z(y) )]
19 )] Bew [N eg (Sb(q 17
x B [Sb(yZ(y)
Z(x)
19
Z(y) ))].
,
.
.
9. :
p = 17 Gen q
(11)
(p 19)
19
r = Sb(qZ(p)
)
(c)
56
(12)
Analytica, 3, 2009
(r 23 17).
(11) (12) .
,
43 44
.
45 ,
, r :
recursive(r). .
24 :
[. . .] r, , [. . .]
, r , , , (. 29)
q(17, 19), 43 25 .
recursive(r) 45 I, 29, 44.
, r
q(17, 19). , q(17, 19) , ,
Q(x, y)
q(u1 , u2 ) (. 2429).
10. :
19
Sb(p19
Z(p) ) = Sb([17 Gen q]Z(p) ) =
23
[ 43 Ibid., p. 99. . .] r
q
p. [
( , ), , :
p.]
24
Ibid., p. 98.
25
. 23 . , 43
I (. Ibid., p. 93).
(c)
57
Analytica, 3, 2009
19
= 17 Gen Sb(qZ(p)
) = 17 Gen r
(13)
( (11) (12));26
, e :
19
Sb(p19
Z(p) ) = Sb([17 Gen q]Z(p) ),
19
Sb([17 Gen q]19
Z(p) ) = 17 Gen Sb(qZ(p) ),
19
17 Gen Sb(qZ(p)
) = 17 Gen r.
e .
p e (11). , p, . ,
e ,
( e
Sb(p19
e Z(p) )),
. , , , .
46 .
47
, 46, 43.
(, : )
. , e P
. ,
,
Sb([17 Gen q]19
Z(p) ) , 19 q,
17 Gen.
, Gen
26
[ 44 Ibid., p. 99. . .] Gen Sb
, .
(c)
58
Analytica, 3, 2009
19
Z(p) )
17
= Sb(rZ(x)
)
(14)
( (12)).
3727 :
Sb[Sb(xy )
z ] Sb(xy z ) ( 2),
17
19
Sb(qZ(x)
:
Z(p) )
17
Sb[Sb(qZ(x)
)19
].
17 19
Z(p)
,
: Z(x) 17
27
Ibid., p. 96.
(c)
59
Analytica, 3, 2009
Z(p) 19. 17
19
19
17
, : Sb(qZ(x)
Z(p) ) Sb(qZ(p) Z(x) ). :
17
19
17
Sb[Sb(qZ(x)
)19
Z(p) ] Sb[Sb(qZ(p) )Z(x) ]. ,
( 51 37):
17
Sb(qZ(x)
19
Z(p) )
19
Sb[Sb(qZ(p)
)17
Z(x) ].
(15)
17
x B (17 Gen r) Bew [N eg (Sb(rZ(x)
))].
(16)
e (9) (10)
(13) (14). p
y ,
39 42. :
17
x B [Sb(p19
Z(p) )] Bew [Sb(qZ(x)
19
Z(p) )],
17
x B [Sb(p19
Z(p) )] Bew [N eg (Sb(qZ(x)
19
Z(p) ))].
53 54 p y, 39 p y, 42 .
(13) (14):
19
19
Sb(p19
Z(p) ) = Sb([17 Gen q]Z(p) ) = 17 Gen Sb(qZ(p) ) = 17 Gen r,
17
Sb(qZ(x)
19
Z(p) )
17
= Sb(rZ(x)
).
, :
17
x B (17 Gen r) Bew [Sb(rZ(x)
)],
(c)
60
Analytica, 3, 2009
17
x B (17 Gen r) Bew [N eg (Sb(rZ(x)
))].
(c)
61
Analytica, 3, 2009
58 17 Gen r x, 6.
Bew (17 Gen r) y(y B (17 Gen r)),
y(y B (17 Gen r)). 59 60. , 58,
modus ponens, 59, 57.
,
n B (17 Gen r), .
,
. n B (17 Gen r).
61 .
y(y B (17 Gen r)),
n B (17 Gen r).
62 , 60, 61.
15. :
,
(16)
17
Bew [N eg (Sb(rZ(n) ))], , 17
, 17 Gen r Sb(rZ(n)
).
:
1) (16),
56,
n x.
63 n x, 56.
17
Bew [N eg (Sb(rZ(n)
))]. 64 modus ponens, 63, 62.
17
2) 17 Gen r Sb(rZ(n)
). :
17
Bew (17 Gen r) Bew (Sb(rZ(n) )). ,
17
Sb(rZ(n)
) 17 Gen r,
.
, e P , , ,
: (a) Subst a(c ) a, c (c)
62
Analytica, 3, 2009
( , Subst, ). a r,
17, c Z(n).
29
17 (r) Subst r(17
Z(n) ).
Sb(xy ) Subst a(b ),
17 Gen r , 17 (r), . . : 17 Gen r 17 (r), 17
: 17 Gen r Sb(rZ(n)
).
, , (8)
. 17 (r),
17
17 (r) Sb(rZ(n)
),
17
Sb(rZ(n) ), . . , .
, Bew (17 Gen r)
17
Bew (Sb(rZ(n)
)) .
17 Gen r, 17
e Sb(rZ(n)
),
17
Sb(rZ(n) ).
17
Sb(rZ(n)
). 65 17
Bew (17 Gen r) Bew (Sb(rZ(n)
)) ,
17
66 Bew (Sb(rZ(n) )) modus ponens, 65, 57.
16. :
, (, ,
).
. , 67
, & , 64 66:
17
17
Bew (Sb(rZ(n)
)) & Bew [N eg (Sb(rZ(n)
))].
29
Ibid., p. 96.
(c)
63
Analytica, 3, 2009
, e 30 :
, ,
.
:
. .
reductio ad absurdum ,
, :
Bew (17 Gen r).
Bew (17 Gen r). , . . . ,
e 68
, 57.
17. :
2. N eg(17 Gen r) .
2 . , , N eg(17 Gen r)
.
: Bew (N eg(17 Gen r)). , , .
,
, .
, , . .:
Bew (N eg(17 Gen r)). 69 .
18. :
: , 17 Gen r
; . . ( (6.1)),
(n)(n B (17 Gen r)).
30
Ibid., p. 98.
(c)
64
Analytica, 3, 2009
, . , .
. , ,
() 31 .
,
n(n B (17 Gen r)).
(6.1), 6. y n, x
17 Gen r. :
Bew (17 Gen r) n(n B (17 Gen r)).
70 n y, 17 Gen r x, 6.
, , :
[
]
Bew (17 Gen r) n(n B (17 Gen r))
[
]
Bew (17 Gen r) n(n B (17 Gen r)) .
71 .
,
31
e
e
(20022003) (. Suber P. G
odels proof. URL:
http://www.earlham.edu/peters/courses/logsys/gproof.htm):
, , G , , , G
, . [. . . ] G :
, . G ,
e ,
.
, G,
. . ,
.
(c)
65
Analytica, 3, 2009
, :
17
)]).
n(Bew [Sb(rZ(n)
e (15),
17
55: x B (17 Gen r) Bew [Sb(rZ(x)
)].
n
x ( 76, n x, 55).
e 17
. n(n B (17 Gen r)) n(Bew [Sb(rZ(n)
)]). 77
, 76.
17
n[Bew (Sb(rZ(n)
))], 78
modus ponens, 77, 75.
20. :
Bew [N eg (17 Gen r)] .
(c)
66
Analytica, 3, 2009
17
, n[Bew (Sb(rZ(n)
))] Bew [N eg (17 Gen r)]
. . 79 e
&, 69, 78,
. : 17
, .
a{n[Bew (Sb(aZ(n) ))] & Bew (N eg ( Gen a))}.
e 80 17,
, 72.
10 :
consist{}
{
}
a n[Bew (Sb(aZ(n) ))] & Bew (N eg( Gen a)) .
. 81 82
.
. , 80
82. 83
&, 80, 82, .
reductio ad absurdum ,
, :
Bew (N eg(17 Gen r)). Bew (N eg(17 Gen r)). , . . .
e 84
69.
21. :
17 Gen r , , VI.
17 Gen r , , :
, . ,
(c)
67
Analytica, 3, 2009
, &
.
( 85, &, 68, 84, ):
Bew (17 Gen r) & Bew (N eg(17 Gen r)).
, II. .
(7), 7, :
Bew (17 Gen r) (17 Gen r) F lg(),
[
]
Bew (N eg(17 Gen r)) (N eg(17 Gen r)) F lg()
[
]
Bew (N eg(17 Gen r)) (N eg(17 Gen r)) F lg() .
88 89 : .
:
Bew (17 Gen r) (17 Gen r) F lg(),
68
Analytica, 3, 2009
90 91
: modus ponens, 88, 86 modus ponens, 89, 87.
85 92
:
(17 Gen r) F lg() & (N eg(17 Gen r)) F lg().
, 17 ,
:
( Gen r) F lg() & (N eg( Gen r)) F lg().
93
17, 92.
. :
1) recursive();
2) consist();
3) Q(x, y);
4) Q(x, y) q(17, 19).
(. . );
, .
, VI:
[(
)
, r recursive() & consist() & recursive(r)
]
( Gen r) F lg() & (N eg( Gen r)) F lg() .
.
1 2. , recursive(r), , q(17, 19). , q(17, 19)
, 4
Q(x, y)
q(u1 , u2 ) (. 2429).
(c)
69
Analytica, 3, 2009
1 2,
1 3. e. ( 94, , 93, , 1):
recursive()
( Gen r) F lg() & (N eg( Gen r)) F lg().
( 95, , 94, , 3):
(
consist() recursive()
)
( Gen r) F lg() & (N eg( Gen r)) F lg() .
, ( 96, , 95):
(
)
consist() & recursive()
( Gen r) F lg() & (N eg( Gen r)) F lg().
( 97, ):
A & B & C A & B.
. :
A consist(), B recursive(), C recursive(r). ( 98, A = consist(), B = recursive(),
C = recursive(r), 97):
consist()
consist()
& recursive().
, ( 99, , 98, 96):
(
)
consist() & recursive() & recursive(r)
( Gen r) F lg() & (N eg( Gen r)) F lg().
e .
( 100, , 99):
(c)
70
Analytica, 3, 2009
[(
r recursive()
)
recursive(r)
]
( Gen r) F lg() & (N eg( Gen r)) F lg() ,
&
consist()
&
( 101, ., 100):
[(
)
, r recursive() & consist() & recursive(r)
]
( Gen r) F lg() & (N eg( Gen r)) F lg() .
VI. II
.
e . .
III
e (. II) . e
.
1.
recursive()
2.
consist()
(
)
a n[Sb(a
) F lg()] & [N eg( Gen a)] F lg()
Z(n)
3.
consist()
4.
,
. 44
5.
6.
7.
,
. 45
,
. 46
8.
Sb(a
Z(n) ) F lg() Bew (Sb(aZ(n) ))
9.
10.
consist{}
a n[Bew (Sb(a
))] & Bew (N eg( Gen a))
Z(n)
., 7,
x = Sb(a
Z(n) )
., 7,
x = N eg( Gen a)
.,
2, 8, 9
(c)
71
Analytica, 3, 2009
11.
12.
Q(x, y) x
19
B [Sb(yZ(y)
)]
13.
Q(x, y)
14.
recursive(x B y)
15.
recursive(Z(y))
. 17
16.
z
recursive(Sb(yx
))
. 31
17.
19
recursive(Sb(yZ(y)
))
I, 16, 15
18.
19
recursive(x B [Sb(yZ(y)
)])
I, 17, 14
19.
recursive(x
19
B [Sb(yZ(y)
)])
20.
recursive(Q(x, y))
(
(
)
R(x1 , . . . , xn ) recursive R(x1 , . . . , xn )
(
r(u1 , . . . , un ) R(x1 , . . . , xn ) r(u1 , . . . , un ) &
{(
)
u1
... un
x1 , . . . , xn R(x1 , . . . , xn ) Bew[Sb(rZ(x
)]
n)
1 ) ... Z(x
}))
(
)
u1
... un
& R(x1 , . . . , xn ) Bew[N eg(Sb(rZ(x
))]
1 ) ... Z(xn )
(
)
recursive (Q(x, y))
q(u1 , u2 ) Q(x, y) q(u1 , u2 ) &
{(
)
u1
u2
x, y Q(x, y) Bew[Sb(qZ(x)
)] &
Z(y) })
)
(
u1
u2
Q(x, y) Bew[N eg(Sb(qZ(x)
))]
Z(y)
(
q(u1 , u2 ) Q(x, y) q(u1 , u2 ) &
{(
)
u1
u2
x, y Q(x, y) Bew[Sb(qZ(x)
)] &
Z(y) })
(
)
u1
u2
Q(x, y) Bew[N eg(Sb(qZ(x)
))]
Z(y)
21.
22.
23.
II, 18
III, 12, 19
V
., 21
m.p. , 22, 20
24.
25.
26.
recursive(q(17, 19))
recursive(Q(x, y)) & Q(x, y) q(17, 19)
. q(17, 19) . r,
Q(x, y) . R, 24
27.
., 26
28.
&., 20, 24
29.
recursive(q(17, 19))
m.p. , 26, 28
30.
., 23, 24,
33.
17
Q(x, y) Bew[Sb(qZ(x)
&., 32
34.
Q(x, y)
35.
17
Bew[Sb(qZ(x)
31.
32.
19
Z(y) )]
17
19
Bew[N eg(Sb(qZ(x)
Z(y) ))]
19
Z(y) )]
17
Bew [Sb(qZ(x)
&, 30
2., 31
&., 32
19
Z(y) )]
(c)
72
. . u1 u2
., 11,
Analytica, 3, 2009
36.
17
19
Bew[N eg(Sb(qZ(x)
Z(y) ))]
37.
17
Q(x, y) Bew [Sb(qZ(x)
19
Z(y) )]
38.
17
Q(x, y) Bew [N eg(Sb(qZ(x)
39.
19
x B [Sb(yZ(y)
)]
17
19
Bew [N eg(Sb(qZ(x)
Z(y) ))]
19
Z(y) ))]
17
19
x = Sb(qZ(x)
Z(y) )
., 11,
17
19
x = N eg(Sb(qZ(x)
Z(y) ))
. , 33, 35
. , 34, 36
17
19
Bew [Sb(qZ(x)
Z(y) )]
., 37, 12
19
B [Sb(yZ(y)
)]
Bew [N eg
41.
42.
19
B [Sb(yZ(y)
)]
19
B [Sb(yZ(y)
)]
43.
p = 17 Gen q
44.
19
r = Sb(qZ(p)
)
45.
recursive(r)
I, 29, 44
46.
Sb(p19
Z(p) )
47.
19
Sb(p19
Z(p) ) = Sb([17 Gen q]Z(p) )
., 46, 43
48.
19
Sb([17 Gen q]19
Z(p) ) = 17 Gen Sb(qZ(p) )
17 = 19, V ar(Gen), 47
49.
19
17 Gen Sb(qZ(p)
) = 17 Gen r
., 44, 48
50.
Sb(p19
Z(p) )
2. =, 4749
. . 46
3732
40.
17
19
(Sb(qZ(x)
Z(y) ))]
19
B [Sb(yZ(y)
)]
17
Bew [N eg (Sb(qZ(x)
19
Z(y) ))]
= 17 Gen r
51.
17
19
Sb(qZ(x)
Z(p) )
52.
17
Sb(qZ(x)
17
= Sb(rZ(x)
)
19
Z(p) )
B [Sb(p19
)]
Z(p)
B [Sb(p19
Z(p) )]
19
Sb[Sb(qZ(p)
)17
Z(x) ]
., 38, 12
., 40, 41
., 44, 51
17
19
Bew [Sb(qZ(x)
Z(p) )]
53.
54.
55.
17
x B (17 Gen r) Bew [Sb(rZ(x)
)]
2 ., 53, 50, 52
56.
17
x B (17 Gen r) Bew [N eg (Sb(rZ(x)
))]
2 ., 54, 50, 52
17
Bew [N eg (Sb(qZ(x)
. p . y, 39
19
Z(p) ))]
. p . y, 42
57.
58.
. 17 Gen r . x, 6
59.
., 58
60.
m.p. , 59, 57
61.
n B (17 Gen r)
62.
n B (17 Gen r)
., 60, 61
63.
17
n B (17 Gen r) Bew [N eg (Sb(rZ(n)
))]
. n . x, 56
64.
17
Bew [N eg (Sb(rZ(n)
))]
m.p. , 63, 62
65.
66.
17
Bew (Sb(rZ(n)
))
m.p. , 65, 57
67.
17
17
Bew (Sb(rZ(n)
)) & Bew [N eg (Sb(rZ(n)
))]
57
68.
32
17
Bew (Sb(rZ(n)
))
G
odel K. Op. cit., p. 96.
(c)
73
Analytica, 3, 2009
69.
70.
71.
. n . y,
17 Gen r . x, 6
72.
73.
., 72
74.
m.p. , 73, 68
75.
, 74
76.
n B (17 Gen r)
. n . x, 55
77.
17
n(n B (17 Gen r)) n(Bew [Sb(rZ(n)
)])
78.
17
n[Bew (Sb(rZ(n)
))]
m.p. , 77, 75
79.
17
n[Bew (Sb(rZ(n)
))] & Bew (N eg (17 Gen r))
80.
{
}
a n[Bew (Sb(a
Z(n) ))] & Bew (N eg ( Gen a))
81.
consist{}
. . 17,
., 79
., 10
82.
83.
m.p. , 71, 70
17
Bew [Sb(rZ(n)
)]
{
a n[Bew (Sb(a
))]
Z(n)
{
a n[Bew (Sb(a
))]
Z(n)
{
a n[Bew (Sb(a
Z(n) ))]
{
a n[Bew (Sb(a
))]
Z(n)
2., 76
}
}
}
}
m.p. , 81, 3
&
84.
. . 69
85.
., 7, x = 17 Gen r
86.
87.
88.
89.
90.
m.p. , 88, 86
91.
m.p. , 89, 87
92.
2 ., 85, 90, 91
93.
. . 17, 92
94.
recursive()
( Gen r) F lg() & (N eg( Gen r)) F lg()
(
consist() recursive()
)
( Gen r) F lg() & (N eg( Gen r)) F lg()
(
)
consist() & recursive()
( Gen r) F lg() & (N eg( Gen r)) F lg()
., 93, . ., 1
A&B &CA&B
95.
96.
97.
(c)
74
., 7,
x = N eg(17 Gen r)
., 94, . ., 3
, 95
Analytica, 3, 2009
98.
consist()
consist()
99.
100.
101.
)
& recursive() & recursive(r)
( Gen r) F lg() & (N eg( Gen r)) F lg()
[(
)
r recursive() & consist() & recursive(r)
]
( Gen r) F lg() & (N eg( Gen r)) F lg()
[(
)
, r recursive() & consist() & recursive(r)
]
( Gen r) F lg() & (N eg( Gen r)) F lg()
consist()
Q.
E.
. A = consist(),
B = recursive(),
C = recursive(r), 97
. , 98, 96
., 99
., 100
D.
e . , , ,
. ,
, , .
, o . , . ,
,
33 :
[. . .] ,
, , V, , ,
.
,
. Q(x, y) ( 13),
Q(x, y) q(17, 19) ( 24). , .
.
. , Q(x, y) 17 Gen r ( 13, 24, 4344, 4650) (. ). , V (8),
33
Ibid., p. 100.
(c)
75
Analytica, 3, 2009
76
Analytica, 3, 2009
V . (
,
2429) :
Q(x, y) q(17, 19) recursive(q(17, 19)).
, ,
(. 24).
. , . . . , e
,
.
, ,
. :
, ,
()
(. ), ,
VI.
(c)
77