1 / 13

Peirce’s Existential Graphs

Peirce’s Existential Graphs. Bram van Heuveln Minds and Machines Lab, RPI Summer 2001. Today’s Topics. Alpha symbolization rules of inference some theory Java implementation. Alpha Sheet of Assertion.

sezja
Download Presentation

Peirce’s Existential Graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Peirce’s Existential Graphs Bram van Heuveln Minds and Machines Lab, RPI Summer 2001

  2. Today’s Topics • Alpha • symbolization • rules of inference • some theory • Java implementation

  3. AlphaSheet of Assertion • To assert some statement in EG, you put the symbolization  of that statement on a sheet of paper, called the ‘Sheet of Assertion’ (SA). The location of the statement on the SA does not matter, i.e: states the same as:  

  4. AlphaSymbolization Symbolization in EG Expression in PL P P  ~         

  5. AlphaInference Rules       Double Cut            (De)Iteration   Erasure    2k 1 2k 1     Insertion  2k+1 1 2k+1 1

  6. AlphaMultiple Readings Possible Readings P Q P  Q or Q P ~(P Q) or ~P  ~Q P Q ~(P  ~Q) or ~P  Q or P  Q P Q ~(~P  ~Q) or P  Q or ~P  Q or ~(~Q  ~P) or Q  P or ~Q  P P Q

  7. (i) f() = T (ii) f([]) = F (iii) f(P) = P (iv) f([P]) = ~P (v) f([D]) = ~f(D) (vi) f(D1 D2) = f(D1)  f(D2) (vii) f([D1 D2]) = f([D1])  f([D2]) (viii) f([D1  [D2  D3]]) = f(D1)  f(D2)  f([D1  [D3]]) (ix) f([[D]]) = f(D) (PROLOG Project: Given subset, generate all readings) AlphaMultiple Readings Formalized (see Shin)

  8. AlphaRecursive Conditional Reading Q R S P This graph can be read as: P  (Q  (R  S)), i.e. P  Q & P  (R  S) or P  Q & (P  R)  S

  9. AlphaRelative Recursive Conditional Reading 0 1  2k-1 2k The Recursive Conditional Reading (RCR) relative to any subgraph 2k-1 or 2k is: 0 & 1 2 &  (1 3  2k-1) 2k

  10. AlphaSoundness of Insertion 0 & 1 2 &  (1 3  2k-1) 2k 0 1  2k-1 2k Strengthening the Antecedent IN 0 & 1 2 &  (1 3  2k-1  )2k  0 1  2k-1 2k

  11. AlphaSoundness of Erasure 0 & 1 2 &  (1 3  2k-1) (2k  )  0 1  2k-1 2k Weakening the Consequent E 0 & 1 2 &  (1 3  2k-1)2k 0 1  2k-1 2k

  12. AlphaSoundness of Iteration/Deiteration Case 1  & 1 2 &  (1 3  2k-1) 2k  1  2k-1 2k p, q  r  p, q  (r  p) IT/DE & 1 2 &  (1 3  2k-1)(2k )   1  2k-1 2k

  13. AlphaSoundness of Iteration/Deiteration Case 2  & 1 2 &  (1 3  2k-1) 2k  1  2k-1 2k p, q  r  p, (q  p)  r IT/DE & 1 2 &  (1 3  2k-1 )2k   1  2k-1 2k

More Related