ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Discrete Mathematics
    MATH2113
    Progress0 / 25 topics
    Topics
    1. Mathematical Reasoning: Sets, Subsets, Algebra of Sets2. Propositions and Compound Statements3. Basic Logical Operations4. Propositional Logic and its Applications with Statement Problems5. Propositions and Truth Tables6. Tautologies and Contradictions7. Conditional and Bi-conditional Statements8. Arguments in Propositional Logic9. Propositional Functions10. Quantifiers and Negation of Quantified Statements11. Relations and Equivalence Relations12. Partial Ordering Relations13. Functions and Recursively Defined Functions14. Combinatorics: Basics of Counting Methods15. Combinations and Permutations16. Pigeonhole Principle17. Graphs and its Types18. Graph Isomorphism19. Trees in Graph Theory20. Connectivity in Graphs21. Eulerian and Hamiltonian Paths22. Spanning Trees and Shortest Path Problem23. Revisiting Special Functions: Power, Floor, Increasing, Decreasing24. Big O, Little O and Omega Notations25. Orders of the Polynomial Functions
    MATH2113›Arguments in Propositional Logic
    Discrete MathematicsTopic 8 of 25

    Arguments in Propositional Logic

    4 minread
    762words
    Beginnerlevel

    Arguments in Propositional Logic


    1. What is an Argument?

    An argument in propositional logic is a sequence of statements (called premises) followed by a conclusion. It is used to determine whether the conclusion logically follows from the premises.

    Form:

    Premise1,Premise2,…,Premisen⊢Conclusion\text{Premise}_1, \text{Premise}_2, \dots, \text{Premise}_n \vdash \text{Conclusion}Premise1​,Premise2​,…,Premisen​⊢Conclusion

    The symbol ⊢\vdash⊢ means "logically implies."


    2. Valid and Invalid Arguments

    • An argument is valid if, whenever all premises are true, the conclusion is also true.
    • An argument is invalid if it is possible for all premises to be true but the conclusion is false.

    Validity depends only on logical structure, not actual content.


    3. Example of a Valid Argument

    Premises:

    1. p→qp \rightarrow qp→q
    2. ppp

    Conclusion:
    qqq

    Form:

    p→q, p⊢qp \rightarrow q,\ p \vdash qp→q, p⊢q

    This is known as Modus Ponens, and it is a valid form of argument.


    4. Common Valid Argument Forms

    a) Modus Ponens (Law of Detachment)

    If p→qp \rightarrow qp→q, and ppp is true, then qqq is true.

    p→q, p⊢qp \rightarrow q,\ p \vdash qp→q, p⊢q

    b) Modus Tollens

    If p→qp \rightarrow qp→q, and ¬q\neg q¬q, then ¬p\neg p¬p.

    p→q, ¬q⊢¬pp \rightarrow q,\ \neg q \vdash \neg pp→q, ¬q⊢¬p

    c) Hypothetical Syllogism

    If p→qp \rightarrow qp→q and q→rq \rightarrow rq→r, then p→rp \rightarrow rp→r.

    p→q, q→r⊢p→rp \rightarrow q,\ q \rightarrow r \vdash p \rightarrow rp→q, q→r⊢p→r

    d) Disjunctive Syllogism

    If p∨qp \lor qp∨q, and ¬p\neg p¬p, then qqq.

    p∨q, ¬p⊢qp \lor q,\ \neg p \vdash qp∨q, ¬p⊢q

    e) Addition

    If ppp, then p∨qp \lor qp∨q

    p⊢p∨qp \vdash p \lor qp⊢p∨q

    f) Simplification

    If p∧qp \land qp∧q, then ppp

    p∧q⊢pp \land q \vdash pp∧q⊢p

    5. Invalid Argument Forms (Fallacies)

    a) Affirming the Consequent (Invalid)

    p→q, q⊢p(Invalid)p \rightarrow q,\ q \vdash p \quad \text{(Invalid)}p→q, q⊢p(Invalid)

    Example:
    If it is raining, then the ground is wet.
    The ground is wet.
    ∴ It is raining. → Not necessarily true (maybe someone watered the garden)


    b) Denying the Antecedent (Invalid)

    p→q, ¬p⊢¬q(Invalid)p \rightarrow q,\ \neg p \vdash \neg q \quad \text{(Invalid)}p→q, ¬p⊢¬q(Invalid)

    Example:
    If it is raining, then the ground is wet.
    It is not raining.
    ∴ The ground is not wet. → Not necessarily true


    6. Testing Argument Validity with Truth Tables

    Construct a truth table including all premises and the conclusion. An argument is valid if every time all premises are true, the conclusion is also true.

    Example:

    Premises: p→qp \rightarrow qp→q, ppp
    Conclusion: qqq

    p q p→qp \rightarrow qp→q Conclusion qqq
    T T T T
    T F F F
    F T T T
    F F T F

    Check the row(s) where all premises are true. If in those rows the conclusion is also true, the argument is valid.

    Here, only the first row has all premises true, and the conclusion is also true → Valid argument.


    7. Use of Rules of Inference

    Arguments can also be validated using a sequence of logical steps (called rules of inference) to derive the conclusion from the premises.


    Previous topic 7
    Conditional and Bi-conditional Statements
    Next topic 9
    Propositional Functions

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time4 min
      Word count762
      Code examples0
      DifficultyBeginner