Services
Discover
Homeschooling
Ask a Question
Log in
Sign up
Filters
Done
Question type:
Essay
Multiple Choice
Short Answer
True False
Matching
Topic
Philosophy
Study Set
Introduction to Formal Logic with Philosophical Applications
Quiz 5: Full First-Order Logic
Path 4
Access For Free
Share
All types
Filters
Study Flashcards
Practice Exam
Learn
Question 201
Essay
construct theories for which the following interpretation is a model (i.e. construct at least two sentences which are true under the given interpretation). Domain = {1, 2, 3, ..., 28, 29, 30} a = 1 e = 21 b = 2 f = 23 c = 4 g = 27 d = 19 h = 29 Ex = {2, 4, 6, ..., 28, 30} Ox = {1, 3, 5, ..., 27, 29} Px = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Sxyz = The set of all triples such that the first is the sum of the second and third {<2, 1, 1>, <3, 1, 2>, <3, 2, 1>, <4, 1, 3>, <4, 2, 2>, <4, 3, 1>, <5, 1, 4>, ... } -Construct a theory of at least two sentences which uses at least two constants.
Question 202
Essay
construct theories for which the following interpretation is a model (i.e. construct at least two sentences which are true under the given interpretation). Domain = {1, 2, 3, ..., 28, 29, 30} a = 1 e = 21 b = 2 f = 23 c = 4 g = 27 d = 19 h = 29 Ex = {2, 4, 6, ..., 28, 30} Ox = {1, 3, 5, ..., 27, 29} Px = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Sxyz = The set of all triples such that the first is the sum of the second and third {<2, 1, 1>, <3, 1, 2>, <3, 2, 1>, <4, 1, 3>, <4, 2, 2>, <4, 3, 1>, <5, 1, 4>, ... } -Construct a theory of at least two sentences, at least one of which uses an existential quantifier.
Question 203
Essay
construct theories for which the following interpretation is a model (i.e. construct at least two sentences which are true under the given interpretation). Domain = {1, 2, 3, ..., 28, 29, 30} a = 1 e = 21 b = 2 f = 23 c = 4 g = 27 d = 19 h = 29 Ex = {2, 4, 6, ..., 28, 30} Ox = {1, 3, 5, ..., 27, 29} Px = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Sxyz = The set of all triples such that the first is the sum of the second and third {<2, 1, 1>, <3, 1, 2>, <3, 2, 1>, <4, 1, 3>, <4, 2, 2>, <4, 3, 1>, <5, 1, 4>, ... } -Construct a theory of at least two sentences, at least one of which uses a universal quantifier.
Question 204
Essay
construct theories for which the following interpretation is a model (i.e. construct at least two sentences which are true under the given interpretation). Domain = {1, 2, 3, ..., 28, 29, 30} a = 1 e = 21 b = 2 f = 23 c = 4 g = 27 d = 19 h = 29 Ex = {2, 4, 6, ..., 28, 30} Ox = {1, 3, 5, ..., 27, 29} Px = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Sxyz = The set of all triples such that the first is the sum of the second and third {<2, 1, 1>, <3, 1, 2>, <3, 2, 1>, <4, 1, 3>, <4, 2, 2>, <4, 3, 1>, <5, 1, 4>, ... } -Construct a theory of at least three sentences, at least one of which uses an existential quantifier and at least one of which uses a universal quantifier.
Question 205
Essay
construct theories for which the following interpretation is a model (i.e. construct at least two sentences which are true under the given interpretation). Domain = {1, 2, 3, ..., 28, 29, 30} a = 1 e = 21 b = 2 f = 23 c = 4 g = 27 d = 19 h = 29 Ex = {2, 4, 6, ..., 28, 30} Ox = {1, 3, 5, ..., 27, 29} Px = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Sxyz = The set of all triples such that the first is the sum of the second and third {<2, 1, 1>, <3, 1, 2>, <3, 2, 1>, <4, 1, 3>, <4, 2, 2>, <4, 3, 1>, <5, 1, 4>, ... } -Construct a theory of at least three sentences which uses all three predicates and at least three different constants.
Question 206
Essay
provide a conterexample in a finite domain to each given invalid argument. -1. Ad ⊃ (∀x)Fdx / (∃x)Fdx
Question 207
Essay
provide a conterexample in a finite domain to each given invalid argument. -1. (∃x)(Dxa • Ex) 2. (∃x)(Dxa • Fx) / (∃x)(Ex • Fx)
Question 208
Essay
provide a conterexample in a finite domain to each given invalid argument. -1. (∀x)[Hx ⊃ (∃y)(Iy • Jxy)] 2. Ha 3. Ib / Jab
Question 209
Essay
provide a conterexample in a finite domain to each given invalid argument. -1. (?x)[Px ? (?y)Qxy] 2. (?x)[(?y)Qxy ? (?y)Rxy] 3. Pa / Rab
Question 210
Essay
provide a conterexample in a finite domain to each given invalid argument. -1. (∀x)[(∃y)(Fxy • Gy) ⊃ (∀y)(Gy ⊃ Fxy)] 2. Ga / (∀x)(Fxa ⊃ Fax)
Question 211
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (?x)[Ex ? (?y)(Fy • Gxy)] 2. (?x)(Ex • Hxb) / (?x)(?y)(Gxy • Hxy)
Question 212
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (?x)(?y)Axy ? (?x)(?y)Bxy 2. (?x)(?y)?Bxy / (?x)(?y)?Axy
Question 213
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (∃x)[Dx • (∀y)(Ey ⊃ Fxy)] 2. (∀x)(Dx ⊃ Ex) / (∃y)(Ey • Fyy)
Question 214
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (∀x)[(Cx • Exa) ⊃ Dx] 2. Cd • ∼Dd / ∼Eda
Question 215
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (∀x)[(Px
∨
\lor
∨
Qx)] ⊃ Rxx] 2. (∀x){Qx ⊃ [(∃y)Rxy ⊃ Sxx]} 3. Pn • Qn / Rnn • Snn
Question 216
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (∀x)[Ax ⊃ (∃y)(By • Cxy)] 2. (∃x)(Ax • Dx) 3. (∀x)(Bx ⊃ Ex) / (∃x)[Dx • (∃y)(Ey • Cxy)]
Question 217
Essay
derive the conclusions of each of the following arguments using the rules of inference for F. -1. (∀x)[Ax ⊃ (∀y)(By ⊃ Cxy)] 2. (∃x)[Ex • (∀y)(Hy ⊃ Cxy)] 3. (∀x)(∀y)(∀z)[(Cxy • Cyz) ⊃ Cxz] 4. (∀x)(Ex ⊃ Bx) / (∀x)[Ax ⊃ (∀y)(Hy ⊃ Cxy)]