ScholarQuill logoScholarQuillUniversity Notes
My Semester
Explore Notes
Past Papers12 New
Video CoursesNew
Search
Settings
Study Tools
GPA/CGPA Calculator
Schedule & To-Do
Student Portal
Contact
Contact
ScholarQuill logo
My Semester
Explore Notes
Past Papers12 New
Video CoursesNew
Search
Settings
GPA/CGPA Calculator
Schedule & To-Do
Student Portal
Contact
ScholarQuill logoScholarQuillUniversity Notes
Study PortalMATH2113Propositional Argument…
Ctrl + K
Login
Explore
Search
Semester
Papers
CGPA
    MATH2113

    Discrete Mathematics

    Progress0 / 25 done
    Topics25
    1Sets, Subsets, Algebra of Sets2Propositions and Compound Statements3Basic Logical Operations4Propositional Logic and its Applications with Statement Problems5Propositions and Truth Tables6Tautologies and Contradictions7Conditional and Bi-conditional Statements8Arguments in Propositional Logic9Propositional Functions10Quantifiers and Negation of Quantified Statements11Relations and Equivalence Relations12Partial Ordering Relations13Functions and Recursively Defined Functions
    14Basics of Counting Methods15Combinations and Permutations16Pigeonhole Principle17Graphs and its Types18Graph Isomorphism19Trees in Graph Theory20Connectivity in Graphs21Eulerian and Hamiltonian Paths22Spanning Trees and Shortest Path Problem
    23Power, Floor, Increasing, Decreasing24Big O, Little O and Omega Notations25Orders of the Polynomial Functions
    4 min read
    Topic 8 of 25
    Topic Study Note Illustration
    08

    Arguments in Propositional Logic

    Arguments in Propositional Logic


    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 view and download past papers

    Click on Show Past Papers to load available exam papers.

    Reading Progress
    0%
    4mremaining
    762words
    Beginnerlevel
    On This Page

    No headings found

    Study Toolkit

    Subject Portal

    Discrete Mathematics