Question: I need only number 7 rewritten using the instructions. The answers to the other questions can be used as an example. connective 1. A set

connective 1. A set of connectives is truth-functionally complete if the allow us to express every truth function. 2. Various sets of connectives, including the Boolean connectives, truth-functionally complete. Exercises 7.25 7 (Replacing A., and +) Use Tarski's World to open the file Sheffer's Sentences. In this file, you will find the following sentences in the odd-numbered positions: 1. Tet(a) Small(a) 3. Tet(a) Small(a) 5. Tet(a) Small(a) 7. (Cube(b) A Cube(c)) (Small(b) Small(c)) In each even-numbered slot, enter a sentence that is equivalent to the one above it, but which uses only the connectives and V. Before submitting your solution file, you might want to try out your sentences in several worlds to make sure the new sentences have the expected truth values. Sheffer's Sentences.sen 1. Tet(a) A Small(a) 2. (-Tet(a) v Small(a)) 3. Tet(a) Small(a) 4. -Tet(a) v Small(a) 5. Tet(a) Small(a) 6. -( - Tet(a) V-Small(a)) v (Tet(a) v Small(a)) (Cube(b) A Cube(c)) + (Small(b) - Small(c)) 7. : This one is long. Tranlate the antecedant and : consequent and then combine them using and v 8
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
