Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

2015-11-27

X.Y. Newberry

(Theorem)

A F G
E F G
I F G
Q F G
A E
(True)(False)
1
A: ~(x)(Fx & ~Gx)
E: ~(x)(Fx & Gx)
I:

(x)(Fx & Gx)

O: (x)(Fx & ~Gx)


1
F ~(x)Fx A E
[ 1] (, 1952, pp. 163-179)

A: ~(x)(Fx & ~Gx) & (x)Fx & (x)~Gx


E: ~(x)(Fx & Gx) & (x)Fx & (x)Gx
I:

(x)(Fx & Gx) v ~(x)Fx v ~(x)Gx

O: (x)(Fx & Gx) v ~(x)Fx v ~(x~)Gx


2
(, 1952, p. 173)
2 (,
1952, p. 173)(x)Fx (Presupposition)~
(x)Fx A
(, p. 174)(x)Fx & (x)~Gx
(x)Fx & (x)~Gx (Not true) A
(Vacuously true)
(Vacuous proposition)
(Truth-relevant)(, 1981)(Predicate)

(P & ~P) Q
~(P & ~P) v Q
~((P & ~P) & ~Q)
(tautology)(, 1981, p. 67.)

(x)(Fx Gx)
(x)(~Fx v Gx)
~(x)(Fx & ~Gx)
~(x)Fx

(Newberry, 2014)
*****
(Diagonal lemma)
(Decidable) Diagy,z y
z y y
Prf(x,z) x z

~(x)(z)(Prf(x,z) & Diag(y,z))

(U)

y k U k U y
G
~(x)(z)(Prf(x,z) & Diag(k,z))

(G)

G.Diag(k,z) G
<G>G H
~(x)Prf(x, <G>)

(H)

~(x)(z)(Prf(x,z) & Diag(k,z)) ~(x)Prf(x,<G>)

(J)

(J)~(x)Prf(x,z)
z ~(x)Prf(x,<>)
G
G
~(x)(Prf(x,1) & Diag(k, 1))
~(x)(Prf(x,2) & Diag(k, 2))
~(x)(Prf(x,3) & Diag(k, 3))

...
n, ~(x)(Prf(x,n) ~(x)Diag(k, n).
~(x)(Prf(x,n) & Diag(k,n)) <=>
(x)(Prf(x,n) -> ~Diag(k,n)) <=>
(x)(Diag(k,n) -> ~Prf(x,n))
n = <G>
(x)(Prf(x,n) -> ~Diag(k,n))
~(n = <G>)
(x)(Diag(k,n) -> ~Prf(x,n))
n = <G>
~(x)(Prf(x,<G>) & Diag(k,<G>))

(K)

K (x)Prf(x,<G>)
K ~(x)Prf(x,<G>) K J
G G


Diaz, M.R. (1981) Topics in the Logic of Relevance, Munich, Germany: Philosophia Verlag.
Newberry, X.Y. (2014) Generalization of the Truth-relevant Semantics to the Predicate
Calculus, http://arxiv.org/ftp/arxiv/papers/1509/1509.06837.pdf
Strawson, P.F. (1952) Introduction to Logical Theory, London, Methuen

Copyright X.Y. Newberry 2015

You might also like