1/19
Looks like no tags are added yet.
Every F is G
Ax(Fx→Gx)
Some Fs are G
Ex(Fx^Gx)
Not all Fs are G
~Ax(Fx→Gx)
No Fs are G
~Ex(Fx^Gx)
Only Fs are G
Ax(Gx→Fx)
At most one F is G
AxAy(Fx^Fy→x=y)
At least one F
Ex(Fx)
Exactly one F is G
AxAy(Fx^Fy→x=y)^ExFx
At least 2 Fs are G
ExEyEz(Fx^Fy^Fz→z=xVz=yVx=y)
Exactly 2 Fs are G
ExEy(Fx^Fy^~x=y^Az(Fz→z=xVz=y))
n | ~Avϕ(v) n | ~Evϕ(v)
| |
| Ev~ϕ(v) | Av~ϕ(v)
CQ n
n | ϕ(a)
| Evϕ(v)
EI n
n | Avϕ(v)
| ϕ(a)
AE n
n | ϕ(a)
| Avϕ(v)
AI n
n | Evϕ(v)
j | | ϕa
| |
k | | ψ
| ψ
EE n, j-k
|
| a=a
=I
n | ϕ(a)
m | a=b
| ϕ(b)
=E n,m
AI restriction
replace all instances of a with x and a cannot appear in attached premises
AE restriction
all instances of a must be replaced with the same letter (x)
EE restriction
a cannot appear in attached premises