Answered: et P be a well-formed formula (WFF)…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Related questions

Question

Let P be a well-formed formula (WFF) corresponding to a conjunction and Q a conditional well-formed formula.

construct specific well-formed formulas for P and Q in such a way that modus ponens can be made between them

Expert Solution

Step 1

Here, in the question, it is given that $P$ is a well-formed formula corresponding to conjunction and $Q$ a conditional well-formed formula. For example, statements like $P, ~ P, Q, ~ Q$ are themselves well-defined formulas. If $' P'$ is a WFF then $~ P$ is a formula as well. If $P & Q$ are WFF's then $(P \lor Q), (P \land Q), (P \Rightarrow Q), (P \Leftrightarrow Q) e t c .$ A well-formed formula, abbreviated WFF or wff, is a finite sequence of symbols from a specified alphabet that is a component of a formal language in mathematical logic, propositional logic, and predicate logic. The set of formulae in the language can be used to identify a formal language.