550 likes | 673 Views
For 42 – 47: UD = everything; Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket There are apples and pears in the basket The only pear in the basket is rotten There are at least two apples in the basket There are two (and only two) apples in the basket
E N D
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • The only pear in the basket is rotten • There are at least two apples in the basket • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • There are at least two apples in the basket • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx • There are at least two apples in the basket • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb& xy ) • There are two (and only two) apples in the basket • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb& xy ) • There are two (and only two) apples in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) & xy ) • There are no more than two pears in the basket • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb& xy ) • There are two (and only two) apples in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) & xy ) • There are no more than two pears in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) ) • 47 there are at least three apples in the basket
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb& xy ) • There are two (and only two) apples in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) ) • There are no more than two pears in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) ) • there are at least three apples in the basket • xyz (Ax & Ay & Az & Nxb & Nyb & Nzb & xy& xz& zy )
For 42 – 47: UD = everything; • Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket • There are apples and pears in the basket • x(Px & Nxb) & x(Ax & Nxb) • The only pear in the basket is rotten • x(Px & Nxb & Rx& y(Py & Nyb y=x) ) • There are at least two apples in the basket • xy(Ax & Nxb & Ay & Nyb& xy ) • There are two (and only two) apples in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) ) • There are no more than two pears in the basket • xy(Ax & Nxb & Ay & Nyb & z(Az & Nzb (z=y z=x) ) • there are at least three apples in the basket • xyz (Ax & Ay & Az & Nxb & Nyb & Nzb & xy& xz& zy ) • there are at most three apples in the basket • xyz (Ax & Ay & Az & Nxb & Nyb & Nzb & • & w(Aw & Nwb w=x w=y w=z) )
SL Truth value assignments
SL Truth value assignments PL Interpretation
SL Truth value assignments PL Interpretation Giving an interpretation means defining: UD
SL Truth value assignments PL Interpretation Giving an interpretation means defining: UD Predicates
SL Truth value assignments PL Interpretation Giving an interpretation means defining: UD Predicates Constants
SL Truth value assignments PL Interpretation Giving an interpretation means defining: UD Predicates Constants Of course, we do not define variables
Truth values of PL sentences are relative to an interpretation
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human • a = Socrates • Bab
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human Fx = x is handsome • a = Socrates a = Socrates • Bab
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human Fx = x is handsome • a = Socrates a = Socrates • Bab • Bxy = x is bigger than y • a = Himalayas • b = Alpes
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human Fx = x is handsome • a = Socrates a = Socrates • Bab • Bxy = x is bigger than y • a = Himalayas a = Himalayas • b = Alpes b = the moon
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human Fx = x is handsome • a = Socrates a = Socrates • Bab • Bxy = x is bigger than y • a = Himalayas a = Himalayas a = Himalayas • b = Alpes b = the moon b = Himalayas
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Fx = x is human Fx = x is handsome • a = Socrates a = Socrates • Bab • Bxy = x is bigger than y • a = Himalayas a = Himalayas a = Himalayas • b = Alpes b = the moon b = Himalayas • No constant can refer to more than one individual!
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Bab • ~xFx • UD = food • Fx = x is in the fridge
Truth values of PL sentences are • relative to an interpretation • Examples: • Fa • Bab • ~xFx • UD = food • Fx = x is in the fridge • UD = everything • Fx = x is in the fridge
Extensional definition of predicates Predicates are sets
Extensional definition of predicates Predicates are sets Their members are everything they are true of
Extensional definition of predicates Predicates are sets Their members are everything they are true of Predicates are defined relative to a UD
Extensional definition of predicates Predicates are sets Their members are everything they are true of Predicates are defined relative to a UD Example: UD = natural numbers Ox = x is odd O = {1,3,5,7,9, ...}
Extensional definition of predicates Predicates are sets Their members are everything they are true of Predicates are defined relative to a UD Example: UD = natural numbers Ox = x is odd Ox = {1,3,5,7,9, ...} Bxy = x>y Bxy = {(2,1), (3,1), (3,2), ...}
Extensional definition of predicates Predicates are sets Their members are everything they are true of Predicates are defined relative to a UD Example: UD = natural numbers Ox = x is odd Bxyz = x is between y and z Ox = {1,3,5,7,9, ...} Bxyz = {(2,1,3), (3,2,4), ...} Bxy = x>y Bxy = {(2,1), (3,1), (3,2), ...}
Extensional definition of predicates Predicates are sets Their members are everything they are true of Predicates are defined relative to a UD Example: UD = natural numbers Ox = x is odd Bxyz = x is between y and z Ox = {1,3,5,7,9, ...} Bxyz = {(2,1,3), (3,2,4), ...} Bxy = x>y Bxyz = y is between x and z Bxy = {(2,1), (3,1), (3,2), ...} Bxyz = {(1,2,3), (2,3,4), ...}
Truth-values of compound sentences (An & Bmn) ~ Cn UD: All positive integers Ax: x is odd Bxy: x is bigger than y Cx: x is prime m: 2 n: 1
Truth-values of compound sentences (An & Bmn) ~ Cn UD: All positive integers Ax: x is odd Bxy: x is bigger than y Cx: x is prime m: 2 n: 1 UD: All positive integers Ax: x is even Bxy: x is bigger than y Cx: x is prime m: 2 n: 1
Truth-values of quantified sentences Birds fly UD = birds xFx
Truth-values of quantified sentences Birds fly UD = birds xFx Fa Fb Fc : Ftwooty :
Truth-values of quantified sentences Birds fly UD = birds UD = everything xFx x(Bx Fx) Fa Fb Fc : Ftwooty :
Truth-values of quantified sentences Birds fly UD = birds UD = everything xFx x(Bx Fx) Fa Ba Fa Fb Bb Fb Fc Bc Fc : : Ftwooty Btwootie Ftwootie : :
Truth-values of quantified sentences Birds fly Some birds don’t fly UD1 = birds UD2 = everything UD1 xFx x(Bx Fx) x~Fx Fa Ba Fa Fb Bb Fb Fc Bc Fc : : Ftwooty Btwootie Ftwootie : :
Truth-values of quantified sentences Birds fly Some birds don’t fly UD1 = birds UD2 = everything UD1 xFx x(Bx Fx) x~Fx Fa Ba Fa ~Ftwootie Fb Bb Fb Fc Bc Fc : : Ftwooty Btwootie Ftwootie : :
Truth-values of quantified sentences Birds fly Some birds don’t fly UD1 = birds UD2 = everything UD1 xFx x(Bx Fx) x~Fx Fa Ba Fa ~Ftwootie Fb Bb Fb Fc Bc Fc UD2 : : x(Bx & ~Fx) Ftwooty Btwootie Ftwootie Bt & ~Ft : :
Truth-values of quantified sentences xFx Fa & Fb & Fc & ...
Truth-values of quantified sentences xFx Fa & Fb & Fc & ... xBx Fa Fb Fc ...
Truth-values of quantified sentences (x)(Ax (y)Lyx)
Truth-values of quantified sentences (x)(Ax (y)Lyx) UD1: positive integers Ax: x is odd Lxy: x is less than y
Truth-values of quantified sentences (x)(Ax (y)Lyx) UD1: positive integers Ax: x is odd Lxy: x is less than y UD2: positive integers Ax: x is even Lxy: x is less than y
Truth-values of quantified sentences (x)(Ax (y)Lyx) UD1: positive integers Ax: x is odd Lxy: x is less than y UD2: positive integers Ax: x is even Lxy: x is less than y (x)(y)(Lxy & ~Ax)
Va & (x) (Lxa ~ Exa) UD1: positive integers Vx: x is even Lxy: x is larger than y Exy: x is equal to y a:2 UD2: positive integers Vx: x is odd Lxy: x is less than y Exy: x is equal to y a:1 UD3: positive integers Vx: x is odd Lxy: x is larger than or equal to y Exy: x is equal to y a: 1
Quantificational Truth, Falsehood, and Indeterminacy A sentence P of PL is quantificationally true if and only if P is true on every possible interpretation. A sentence P of PL is quantificationally false if and only if P is false on every possible interpretation. A sentence P of PL is quantificationally indeterminate if and only if P is neither quantificationally true nor quantificationally false.