Scribd Logo
Upload

Welcome to Scribd!

  • 25 views

    Bil133 HW1 2023

    Uploaded by

    Nihat emre Yüzügüldü
    This document contains 4 study questions on propositional and predicate logic: 1. Prove 4 propositional logic sequents using natural deduction rules without derived rules. 2. Prove 2 propositional logic theorems using natural deduction rules including derived rules. 3. Prove 4 predicate logic sequents. 4. Draw the parse trees and list subformulas for 2 logic formulas, indicating bound and free variables in one.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Bil133 HW1 2023

    Uploaded by

    Nihat emre Yüzügüldü
    25 views2 pages
    This document contains 4 study questions on propositional and predicate logic: 1. Prove 4 propositional logic sequents using natural deduction rules without derived rules. 2. Prove 2 propositional logic theorems using natural deduction rules including derived rules. 3. Prove 4 predicate logic sequents. 4. Draw the parse trees and list subformulas for 2 logic formulas, indicating bound and free variables in one.

    Original Title

    BIL133_HW1_2023

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 4 study questions on propositional and predicate logic: 1. Prove 4 propositional logic sequents using natural deduction rules without derived rules. 2. Prove 2 propositional logic theorems using natural deduction rules including derived rules. 3. Prove 4 predicate logic sequents. 4. Draw the parse trees and list subformulas for 2 logic formulas, indicating bound and free variables in one.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    25 views2 pages

    Bil133 HW1 2023

    Uploaded by

    Nihat emre Yüzügüldü
    This document contains 4 study questions on propositional and predicate logic: 1. Prove 4 propositional logic sequents using natural deduction rules without derived rules. 2. Prove 2 propositional logic theorems using natural deduction rules including derived rules. 3. Prove 4 predicate logic sequents. 4. Draw the parse trees and list subformulas for 2 logic formulas, indicating bound and free variables in one.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    TOBB ETU C OMPUTER E NGINEERING D EPARTMENT

    BIL 133 Combinatorics and Graph Theory

    Study Question Set - 1

    1 P ROVING P ROPOSITIONAL L OGIC S EQUENTS


    Prove the following propositional logic sequents using basic natural deduction rules. You are
    NOT allowed to use the derived rules MT, RAA, LEM and double-negation.

    a) p ∧ (¬p ∨ q) ⊢ q

    b) ¬p → ¬q ⊢ (¬p → q) → p

    c) p → q ∨ r ⊢ ¬q → (p → r )

    d) p → (q → r ) ⊢ p ∧ q → r

    2 P ROVING P ROPOSITIONAL T HEOREMS


    Recall that logical formulas φ such that ⊢ φ holds are called theorems, i.e., all of the below
    sequents are theorems. And you are asked to prove them using natural deduction rules. Aside
    from basic natural deduction rules, you CAN also use the derived rules MT, RAA, LEM and
    double-negation.

    a) ⊢ p ∧ q → ((p → s) ∨ (q → s) → s)

    b) ⊢ (p → q) → ((q ∧ r → s) → (¬s ∧ p → ¬r ))

    1
    3 P ROVING P REDICATE L OGIC S EQUENTS
    Prove the following predicate logic sequents.

    a) ∀x(P (x) ∧Q(x)) ⊢ ∃xP (x) ∧ ∃xQ(x).

    b) ∀x(¬P (x) ∧Q(x)) ⊢ ∀x(P (x) → Q(x))

    c) ∀x(P (x) ∨Q(x)), ∀x¬Q(x) ⊢ ∀xP (x)

    d) ∀x∀y(P (x) ∧Q(x) → R(y)), ∀xP (x), ∃y¬R(y) ⊢ ∃x¬Q(x)

    4 D RAWING PARSE T REE OF L OGIC F ORMULAS


    a) (p ∧ q → ¬r ) → (q → (¬r ∨ (¬p ∧ s))))

    • Draw parse tree of the formula above.


    • List all of its subformulas.

    b) ∀xP (x) ∧ (∃y(Q(x, y) ∧Q(y, z) → ∀zR(x, z)))


    • Draw parse tree of the formula above.
    • Indicate bound and free variables.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy