Purchase Solution

Symbolic Logic Problem : Sentence to Expression

Not what you're looking for?

Ask Custom Question

Transcribe the English argument below into an appropriate logical language adequate to determine it to be valid. Also, please provide a derivation of the conclusion from the premises within the same logical system (by which you transcribed it). *this seems to be predicate logic and probably requires universal and existential quantifier. For universal use (X). Existential, use (E).

Every mental state is identical with some brain state or other. All mental states are introspectable. There is at least one mental state. Hence, some brain state is introspectable.

Purchase this Solution
Solution Summary

An argument is transcribed into a symbolic logic expression. The introspectable mental state is analyzed.

Solution Preview

Well, the first part is "Every mental state is identical with some brain state or other". We can write it as:

(X)(MX--->(EY)(BY & X=Y))
where X and Y are universal and M shows the mental state and B shows the brain state and X=Y means those two are identical.

Then we have: "All mental states are introspectable." which means:
(X)(MX--->IX)
where I means introspectable.

Finally we ...

Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Symbolic Logic Problem

    11522 Symbolic Logic Problems Indicated Use the method of truth table expansion to determine whether or not the sentence below is a theorem of quantified logic. The # indicates a biconditional, usually indicated by a double arrow.

  • Symbolic Logic: Modus Ponens and Modus Tollens

    516890 Symbolic Logic: Modus Ponens and Modus Tollens Symbolic Logic PART 1 1. Write two arguments in English, one in the form of modus ponens and one in the form of modus tollens.

  • Symbolic Logic Problem

    11517 Symbolic Logic Problem for Negotiation Rules I need to know how to construct a formal proof which shows that the sentence below is a theorem of predicate logic. The ^ sign indicates the word "or".

  • Symbolic Logic Problem : Proof

    11566 Symbolic Logic Problem : Proof Construct a formal proof which shows that the sentence below is a theorem of predicate logic. *the E's are existential quantifiers (usually designated by backwards E's). the & are "and".

  • Symbolic Logic : Predicate Logic

    11520 Symbolic Logic : Predicate Logic The sentence below is a theorem of predicate logic. Show that it is by deriving it from the null set of premises. If any "individual" in the domain has a property, then every individual has it.

  • Symbolic Logic Problem

    A symbolic logic expression is proven to be invalid. A derivative of the conclusion from the premise is provided. Invalid interpretation are analyzed.

  • Logic Problems

    276472 Logic Problems Statements 1. Write the statement in symbolic form and construct a truth table. The zoo is open, but it is not a nice day. 2. Use DeMorgan's laws to determine whether the two statements are equivalent. ? (p V ?q), ?

  • Translation of Sentences into Symbolic Predicate Logic

    Problem C: "Frank will get a bonus if all of his projects are completed on schedule." Please see the attachment. We translate various quantified sentences into symbolic predicate logic and form their negations.

  • Logic : Decidable Systems

    To do so, show how to convert a sentence 0, over the language of Th(A(, <), to a sentence 02 over the language of Th(AF, +) while preserving truth or falsity in the respective models.

View More Related Solutions