Scribd Logo
Upload

Welcome to Scribd!

  • Tree Completeness

    Uploaded by

    bdscriya
    8 views1 page
    The document proves the completeness of representations of natural numbers and trees of natural numbers. It first defines P to represent natural numbers as either null or the successor of another natural number. It then uses introduction and elimination rules to show P holds for all natural numbers n. Next, it defines P for trees as either null or a node with a natural number and two subtree values. It similarly uses introduction and elimination rules to show P holds for all trees t.

    Original Description:

    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
    The document proves the completeness of representations of natural numbers and trees of natural numbers. It first defines P to represent natural numbers as either null or the successor of another natural number. It then uses introduction and elimination rules to show P holds for all natural numbers n. Next, it defines P for trees as either null or a node with a natural number and two subtree values. It similarly uses introduction and elimination rules to show P holds for all trees t.

    Copyright:

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

    Tree Completeness

    Uploaded by

    bdscriya
    The document proves the completeness of representations of natural numbers and trees of natural numbers. It first defines P to represent natural numbers as either null or the successor of another natural number. It then uses introduction and elimination rules to show P holds for all natural numbers n. Next, it defines P for trees as either null or a node with a natural number and two subtree values. It similarly uses introduction and elimination rules to show P holds for all trees t.

    Copyright:

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

    Completeness of the representation of natural numbers

    P = ((x =N Null ) ((n : N ).(x =N (succ n)))

    n:N

    m:N
    (N I)
    (succ m) : N
    (II)
    r((succ m)) : ((succ m) =N (succ n))
    (I)
    (m, r((succ m))) : (n : N )((succ m) =N (succ n))
    (I)
    inr ((m, r((succ m)))) : P [succ m/x]
    0:N
    (II)
    ( = I)
    r(0) : (0 =N 0)
    p.inr ((m, r((succ m)))) : (P [n/x] = P [succ m/x])
    (I)
    inl (r(0)) : P [0/x]
    m.p.inr ((m, r((succ m)))) : (m : N ).(P [n/x] = P [succ m/x])
    prim inl (r(0)) ((p.inr ((m, r((succ m))))) : P [n/x]
    (E)
    n.(prim inl (r(0)) ((p.inr ((m, r((succ m)))))) : (n : N ).(P [n/x])

    (I)
    (N E)

    Completeness of the representation of trees of natural numbers


    P = ((x =tree Null ) ((n : N ).(u : tree).(v : tree).(x =tree (Bnode n u v)))

    t : tree

    [m : N ]
    [c1 : tree]
    [c2 : tree]
    (treeI)
    (Bnode m c1 c2 ) : tree
    (II)
    r((Bnode m c1 c2 )) : ((Bnode m c1 c2 ) =tree (Bnode m c1 c2 ))
    (I)3
    (m, (c1 , (c2 , r((Bnode m c1 c2 ))))) : (n : N ).(u : tree).(v : tree).((Bnode m c1 c2 ) =tree (Bnode n u v))
    (I)
    inr ((m, (c1 , (c2 , r((Bnode m c1 c2 )))))) : P [(Bnode m c1 c2 )/x]
    Null : tree
    (II)
    ( = I)2
    r(Null ) : (Null =tree Null )
    p.q.(inr ((m, (c1 , (c2 , r((Bnode m c1 c2 ))))))) : (P [u/x] = P [v/x] = P [(Bnode m c1 c2 )/x])
    (I)
    inl (r(Null )) : P [Null/x]
    m.c1 .c2 .p.q.(inr ((m, (c1 , (c2 , r((Bnode m c1 c2 ))))))) : (m : N ).(c1 : tree).(c2 : tree).(P [u/x] = P [v/x] = P [(Bnode m c1 c2 )/x])
    (trec inl (r(Null )) (m.c1 .c2 .p.q.(inr ((m, (c1 , (c2 , r((Bnode m c1 c2 ))))))))) : P [t/x]
    (I)
    t.(trec inl (r(Null )) (m.c1 .c2 .p.q.(inr ((m, (c1 , (c2 , r((Bnode m c1 c2 ))))))))) : (t : tree).(P [t/x])

    (I)3
    (treeE)

    You might also like