Scribd Logo
Upload

Welcome to Scribd!

  • Pred Rules PDF

    Uploaded by

    dharmendra2068
    11 views1 page
    This document summarizes key inference rules for predicate logic, including: 1) Universal instantiation and existential instantiation rules for deriving statements from quantified statements. 2) Universal generalization and existential generalization rules for deriving quantified statements. 3) Using temporary hypotheses to derive implications between statements in a proof sequence. 4) An equivalence rule for negating quantified statements.

    Original Description:

    This is the rule.

    Original Title

    pred-rules.pdf

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document summarizes key inference rules for predicate logic, including: 1) Universal instantiation and existential instantiation rules for deriving statements from quantified statements. 2) Universal generalization and existential generalization rules for deriving quantified statements. 3) Using temporary hypotheses to derive implications between statements in a proof sequence. 4) An equivalence rule for negating quantified statements.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views1 page

    Pred Rules PDF

    Uploaded by

    dharmendra2068
    This document summarizes key inference rules for predicate logic, including: 1) Universal instantiation and existential instantiation rules for deriving statements from quantified statements. 2) Universal generalization and existential generalization rules for deriving quantified statements. 3) Using temporary hypotheses to derive implications between statements in a proof sequence. 4) An equivalence rule for negating quantified statements.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    CSCI 1323 (Discrete Structures), Spring 2013 Derivation Rules for Predicate Logic

    Inference rules
    From (x)P (x) Can derive P (t), where t is a variable or constant symbol P (a), where a is a variable or constant symbol not previously used in proof sequence (X )P (x) Name/abbreviation Restrictions on use Universal If t is a variable, it instantiation ui must not fall within the scope of a quantier for t. Existential Must be the rst rule instantiation ei used that introduces a.

    (x)P (x)

    P (x)

    Universal generalization ug

    P (x) or P (a), where P (a) is a constant symbol

    (X )P (x)

    Existential generalization eg

    P (x) has not been deduced from any hypotheses in which x is a free variable, nor has P (x) been deduced by ei from any w in which x is a free variable. To go from P (a) to (x)P (x), x must not appear in P (a).

    Temporary hypotheses
    Given hypotheses P1 , . . . Pn , you can derive T S in a proof sequence as follows: 1. Introduce T as a temporary hypotheses: Write T as the n-th step of the proof sequence, with a justication of temporary hyp. 2. Prove S given T and the hypotheses: Apply derivation rules to steps 1 through n of the sequence to produce steps n + 1 through m, where step m derives S . Indent these steps to indicate that they depend on a temporary hypothesis. 3. Derive T S , giving as a justication temp. hyp discharged. You then continue with the main proof sequence as usual, except that the indented steps (n + 1 through m) cannot be used to derive subsequent steps in the sequence.

    Equivalence rule
    Expression ((x)A(x)) Equivalent to (x)(A(x) ) Name/abbreviation Negation neg

    You might also like