a sequent calculus for opetopes
play

A sequent calculus for opetopes CT 2019 Pierre-Louis Curien 1 Cdric - PowerPoint PPT Presentation

Feb 23, 2023 •424 likes •1.64k views

A sequent calculus for opetopes CT 2019 Pierre-Louis Curien 1 Cdric Ho Thanh 1 Samuel Mimram 2 July 9th, 2019 1 IRIF, Paris University 2 LIX, cole Polytechnique This presentation informally presents some of the main notions and results of

  1. Idea: dimension 0 and 1 Denote by ⧫ the unique 0-opetope, a.k.a. the point: . and by ◾ the unique 1-opetope, a.k.a. the arrow: . . We can represent ◾ as a node of a tree as follows: ⧫ ∗ [] ◾ ⧫ Let us add address information. 11

  2. 2. consider that tree as a corolla, where the input edges are the nodes 3. be convinced that this is a good representation of some 2-opetope! Idea: dimension 2 Then we can: 1. create a tree with that corolla representing ◾ ⧫ ∗ [ ∗∗ ] ◾ ⧫ ∗ [ ∗ ] ◾ ⧫ ∗ [] ◾ ⧫ 12

  3. 3. be convinced that this is a good representation of some 2-opetope! Idea: dimension 2 Then we can: 1. create a tree with that corolla representing ◾ ⧫ ∗ [ ∗∗ ] ◾ [ ] ∗ [ ∗ ] [ ∗ ] ⧫ ∗ [ ∗ ] ◾ ◾ ◾ [] ◾ 3 ⧫ ∗ [] ◾ ◾ ⧫ 2. consider that tree as a corolla, where the input edges are the nodes 12

  4. Idea: dimension 2 Then we can: 1. create a tree with that corolla representing ◾ ⧫ ∗ [ ∗∗ ] ◾ [ ] ∗ [ ∗ ] . . [ ∗ ] ⧫ ∗ [ ∗ ] ◾ ◾ ◾ [] ⇓ ◾ 3 . . ⧫ ∗ [] ◾ ◾ ⧫ 2. consider that tree as a corolla, where the input edges are the nodes 3. be convinced that this is a good representation of some 2-opetope! 12

  5. Idea: dimension 2 Depending on the original tree, we obtain different 2-opetopes: ⧫ ∗ [ [ ∗ ] ] ∗ [ ] . ◾ ◾ ◾ [] ⟿ ⟿ ⧫ ∗ ⇓ [] 2 . . ◾ ◾ ⧫ 13

  6. Idea: dimension 2 Depending on the original tree, we obtain different 2-opetopes: ⧫ ∗ [ ∗∗⋯∗ ] ◾ ⧫ ∗ [ ∗ ] ∗ [ ∗ ] ⋯ [ ⋯ ∗ ] ⋮ ( n − 1 ) . . . ◾ ◾ ◾ [] ⟿ ⟿ n ( n ) ⇓ ( 1 ) . . ⧫ ∗ [ ∗ ] ◾ ◾ ⧫ ∗ [] [] ◾ ⧫ 13

  7. Idea: dimension 2 Depending on the original tree, we obtain different 2-opetopes: ◾ ⧫ [] ∗ [] [] 1 ⟿ ⟿ ◾ ⇓ . . ⧫ ◾ 13

  8. Idea: dimension 2 Depending on the original tree, we obtain different 2-opetopes: [] . 0 ⟿ ⟿ ⧫ ⇓ ◾ 13

  9. Idea: dimension 3 From there, repeat the process! [ ] ] ∗ ◾ ◾ [ [ [[ ∗ ]] ] ] ] 2 2 2 ∗ [ [ [ ] [] ⟿ A ◾ ◾ [ ∗ ] [] 2 3 ◾ . . . . ⟿ ⇓ ⇓ ⇛ ⇓ . . . . 14

  10. Idea: dimension 3 From there, repeat the process! [[]] 0 [ ] ] 0 1 ] [ ◾ [] [ [] [] ⟿ B 1 0 ◾ . . ⇓ ⟿ ⇛ ⇓ ⇓ 14

  11. Idea: dimension 3 From there, repeat the process! [[ ∗ ]] 0 [ [ ] ] ] 0 ] 2 ∗ ◾ ◾ [ [ [ ∗ ] [] [] ⟿ C 2 0 ◾ . . . . ⇓ ⟿ ⇓ ⇓ ⇛ 14

  12. Idea: dimension 3 From there, repeat the process! [ ] ] ◾ ◾ ∗ ◾ [ [] [ ] [[ ∗ ]] [[ ∗∗ ]] [[ ∗ ]] ] 2 1 3 2 1 ] ∗ [ ] [ ∗ [ [] ⟿ D ◾ ◾ ◾ [ ∗ ] [] [ ∗∗ ] 3 4 ◾ . . ⇓ ⟿ ⇛ . . . . ⇓ ⇓ ⇓ . . . . 14

  13. Solution In an n -opetope, every node is decorated by n 1 -opetope, but n 1 -opetope does not uniquely identify a node. But addresses do! So we just need to describe a partial map n 1 Syntax We now want a syntactic description of such trees. 15

  14. but n 1 -opetope does not uniquely identify a node. But addresses do! So we just need to describe a partial map n 1 Syntax We now want a syntactic description of such trees. Solution ◾ ◾ 2 . . . . ⟿ ◾ ◾ ⇓ ⇓ ⇛ ⇓ 2 . . . . ◾ In an n -opetope, every node is decorated by ( n − 1 ) -opetope, 15

  15. But addresses do! So we just need to describe a partial map n 1 Syntax We now want a syntactic description of such trees. Solution ◾ ◾ 2 . . . . ⟿ ◾ ◾ ⇓ ⇓ ⇛ ⇓ 2 . . . . ◾ In an n -opetope, every node is decorated by ( n − 1 ) -opetope, but ( n − 1 ) -opetope does not uniquely identify a node. 15

  16. Syntax We now want a syntactic description of such trees. Solution [ ] ] ◾ ◾ ∗ [ [[ ∗ ]] 2 [ ] . . . . ⟿ ⇓ ◾ ⇓ ◾ ⇛ [ ∗ ] [] ⇓ 2 . . . . ◾ In an n -opetope, every node is decorated by ( n − 1 ) -opetope, but ( n − 1 ) -opetope does not uniquely identify a node. But addresses do! So we just need to describe a partial map 15 A � → O n − 1 .

  17. Syntax We encode opetopes recursively as follows: [ ] ] ∗ ⎧ ◾ ◾ [ ⎪ [[ ∗ ]] [] ← 2 ⎪ 2 ⎨ [ ] ⎪ [[ ∗ ]] ← 2 ⎪ ⟿ ⎩ ◾ ◾ [ ∗ ] [] 2 ◾ 16

  18. Syntax We encode opetopes recursively as follows: [ ] ] ∗ ⎧ ◾ ◾ [ ⎪ [[ ∗ ]] [] ← 2 ⎪ 2 ⎨ [ ] ⎪ [[ ∗ ]] ← 2 ⎪ ⟿ ⎩ ◾ ◾ [ ∗ ] [] 2 ◾ Reminder ⧫ ∗ [ ∗ ] ◾ 2 = ⧫ ∗ [] ◾ 16 ⧫

  19. Syntax We encode opetopes recursively as follows: [ ] ] ∗ ⎧ ◾ ◾ [ ⎪ [[ ∗ ]] [] ← 2 ⎪ 2 ⎨ [ ] ⎪ [[ ∗ ]] ← 2 ⎪ ⟿ ⎩ ◾ ◾ [ ∗ ] [] 2 ◾ Reminder ⧫ ⎧ ∗ [ ∗ ] ⎪ ⎪ [] ← ◾ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ 16 ⧫

  20. Syntax We encode opetopes recursively as follows: ⎧ ⎧ ⎪ ⎪ [ [] ← ◾ ⎪ ⎪ ] ⎪ ⎪ ] [] ← ⎨ ⎪ ∗ ◾ ◾ ⎪ [ ⎪ ⎪ [ ∗ ] ← ◾ [[ ∗ ]] ⎪ ⎪ ⎩ 2 ⎨ ⎧ [ ] ⎪ ⎪ ⎪ ⎪ [] ← ◾ ⟿ ⎪ ⎪ ◾ ◾ [[ ∗ ]] ← ⎨ ⎪ [ ∗ ] [] ⎪ ⎪ ⎪ [ ∗ ] ← ◾ ⎪ ⎪ 2 ⎩ ⎩ ◾ Reminder ⧫ ⎧ ∗ [ ∗ ] ⎪ ⎪ [] ← ◾ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ 16 ⧫

  21. Syntax We encode opetopes recursively as follows: ⎧ ⎧ ⎪ ⎪ [ [] ← ◾ ⎪ ⎪ ] ⎪ ⎪ ] [] ← ⎨ ⎪ ∗ ◾ ◾ ⎪ [ ⎪ ⎪ [ ∗ ] ← ◾ [[ ∗ ]] ⎪ ⎪ ⎩ 2 ⎨ ⎧ [ ] ⎪ ⎪ ⎪ ⎪ [] ← ◾ ⟿ ⎪ ⎪ ◾ ◾ [[ ∗ ]] ← ⎨ ⎪ [ ∗ ] [] ⎪ ⎪ ⎪ [ ∗ ] ← ◾ ⎪ ⎪ 2 ⎩ ⎩ ◾ Convention { ∗ ← ⧫ ◾ = 16

  22. Syntax We encode opetopes recursively as follows: ⎧ ⎧ ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ [ ⎪ ⎪ ] ⎪ ⎪ [] ← ⎨ ] ⎪ ∗ ◾ ◾ ⎪ [ ⎪ ⎪ [ ∗ ] ← { ∗ ← ⧫ ⎪ [[ ∗ ]] ⎪ ⎩ 2 ⎨ [ ⎧ ] ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⟿ ⎪ ⎪ ⎪ ◾ ◾ ⎪ [[ ∗ ]] ← ⎨ [ ∗ ] [] ⎪ ⎪ ⎪ ⎪ [ ∗ ] ← { ∗ ← ⧫ 2 ⎪ ⎪ ⎩ ⎩ ◾ Convention { ∗ ← ⧫ ◾ = 16

  23. 1 0 Syntax: examples [[]] 0 ◾ [] [] 1 ◾ 17

  24. Syntax: examples [[]] 0 ⎧ ⎪ ⎪ [] ← 1 ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ 17

  25. Syntax: examples [[]] 0 ⎧ ⎪ ⎪ [] ← 1 ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ Reminder ⧫ {[] ← ◾ ∗ [] 1 = = ◾ ⧫ 17

  26. Syntax: examples [[]] 0 ⎧ ⎪ [] ← {[] ← ◾ ⎪ ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ Reminder ⧫ {[] ← ◾ ∗ [] 1 = = ◾ ⧫ 17

  27. Syntax: examples [[]] 0 ⎧ ⎪ [] ← {[] ← ◾ ⎪ ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ Reminder { ∗ ← ⧫ ◾ = 17

  28. Syntax: examples [[]] 0 ⎧ ⎪ [] ← {[] ← { ∗ ← ⧫ ⎪ ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ Reminder { ∗ ← ⧫ ◾ = 17

  29. Syntax: examples [[]] 0 ⎧ ⎪ [] ← {[] ← { ∗ ← ⧫ ⎪ ⎨ ◾ [] [] ⎪ [[]] ← 0 ⎪ ⟿ ⎩ 1 ◾ Reminder + convention { { ⧫ 0 = = ⧫ 17

  30. Syntax: examples [[]] 0 ⎧ ⎪ [] ← {[] ← { ∗ ← ⧫ ⎪ ⎨ ◾ [] [] ⎪ [[]] ← { { ⧫ ⎪ ⟿ ⎩ 1 ◾ Reminder + convention { { ⧫ 0 = = ⧫ 17

  31. 2 0 Syntax: examples [[ ∗ ]] 0 [ ] ◾ ◾ [ ∗ ] [] 2 ◾ 18

  32. Syntax: examples [[ ∗ ]] 0 ⎧ [ ⎪ ] ⎪ [] ← 2 ⎨ ◾ ◾ [ ∗ ] [] ⎪ [[ ∗ ]] ← 0 ⎪ ⟿ ⎩ 2 ◾ 18

  33. Syntax: examples [[ ∗ ]] 0 ⎧ [ ⎪ ] ⎪ [] ← 2 ⎨ ◾ ◾ [ ∗ ] [] ⎪ [[ ∗ ]] ← 0 ⎪ ⟿ ⎩ 2 ◾ Reminder ⧫ ⎧ ∗ [ ∗ ] ⎪ ⎪ [] ← ◾ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ ⧫ 18

  34. Syntax: examples ⎧ [[ ∗ ]] ⎧ ⎪ ⎪ ⎪ [] ← ◾ 0 ⎪ [ ⎪ [] ← ⎨ ] ⎪ ⎪ ⎨ [ ∗ ] ← ◾ ◾ ⎪ ◾ [ ∗ ] ⎩ [] ⎪ ⎪ ⟿ ⎪ 2 ⎪ [[ ∗ ]] ← 0 ⎩ ◾ Reminder ⧫ ⎧ ∗ [ ∗ ] ⎪ ⎪ [] ← ◾ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ ⧫ 18

  35. Syntax: examples ⎧ [[ ∗ ]] ⎧ ⎪ ⎪ ⎪ [] ← ◾ 0 ⎪ [ ⎪ [] ← ⎨ ] ⎪ ⎪ ⎨ [ ∗ ] ← ◾ ◾ ⎪ ◾ [ ∗ ] ⎩ [] ⎪ ⎪ ⟿ ⎪ 2 ⎪ [[ ∗ ]] ← 0 ⎩ ◾ Reminder { ∗ ← ⧫ ◾ = 18

  36. Syntax: examples ⎧ ⎧ [[ ∗ ]] ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ 0 ⎪ [ ⎪ [] ← ⎨ ] ⎪ ⎪ ⎨ [ ∗ ] ← { ∗ ← ⧫ ◾ ⎪ ◾ [ ∗ ] ⎩ [] ⎪ ⎪ ⟿ ⎪ 2 ⎪ ⎪ [[ ∗ ]] ← 0 ⎩ ◾ Reminder { ∗ ← ⧫ ◾ = 18

  37. Syntax: examples ⎧ ⎧ [[ ∗ ]] ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ 0 ⎪ [ ⎪ [] ← ⎨ ] ⎪ ⎪ ⎨ [ ∗ ] ← { ∗ ← ⧫ ◾ ⎪ ◾ [ ∗ ] ⎩ [] ⎪ ⎪ ⟿ ⎪ 2 ⎪ ⎪ [[ ∗ ]] ← 0 ⎩ ◾ Reminder { { ⧫ 0 = = ⧫ 18

  38. Syntax: examples ⎧ ⎧ [[ ∗ ]] ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ 0 ⎪ [ ⎪ [] ← ⎨ ] ⎪ ⎪ ⎨ [ ∗ ] ← { ∗ ← ⧫ ⎪ ◾ ◾ ⎩ [ ∗ ] [] ⎪ ⎪ ⟿ ⎪ 2 ⎪ ⎪ [[ ∗ ]] ← { { ⧫ ⎩ ◾ Reminder { { ⧫ 0 = = ⧫ 18

  39. 3 2 1 Syntax: examples [ ] ] ∗ ◾ ◾ ◾ [ [] [[ ∗ ]] [[ ∗∗ ]] 2 1 [ ] ◾ ◾ ◾ [ ∗ ] [] [ ∗∗ ] 3 ◾ 19

  40. Syntax: examples [ ] ⎧ ] ⎪ [] ← 3 ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ 2 1 ⎨ [[ ∗ ]] ← 2 [ ] ⎪ ⎪ ⟿ ⎪ ⎪ ◾ ◾ ◾ [[ ∗∗ ]] ← 1 [ ∗ ] ⎩ [] [ ∗∗ ] 3 ◾ 19

  41. Syntax: examples [ ] ⎧ ] ⎪ [] ← 3 ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ 2 1 ⎨ [[ ∗ ]] ← 2 [ ] ⎪ ⎪ ⟿ ⎪ ⎪ ◾ ◾ ◾ [[ ∗∗ ]] ← 1 [ ∗ ] ⎩ [] [ ∗∗ ] 3 ◾ Reminder ⧫ ∗ [ ∗∗ ] ⎧ [] ← ◾ ⎪ ⎪ ◾ ⎪ ⎪ ⎨ [ ∗ ] ← ◾ ⧫ [ ∗ ] ∗ 3 ⎪ ⎪ = = ◾ ⎪ ⎪ [ ∗∗ ] ← ◾ ⎩ ⧫ [] ∗ ◾ ⧫ 19

  42. Syntax: examples ⎧ ⎧ ⎪ ⎪ [] ← ◾ ⎪ ⎪ ⎪ ⎪ [ ⎪ ] ⎪ ⎪ ⎪ ] ⎪ [] ← ⎨ [ ∗ ] ← ◾ ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎪ ⎪ 2 1 ⎨ ⎪ [ ∗∗ ] ← ◾ [ ⎩ ] ⎪ ⎪ ⟿ ⎪ ⎪ ◾ ◾ ◾ [[ ∗ ]] ← 2 [ ∗ ] ⎪ [] [ ∗∗ ] ⎪ ⎪ ⎪ 3 ⎪ ⎪ [[ ∗∗ ]] ← 1 ⎩ ◾ Reminder ⧫ [ ∗∗ ] ∗ ⎧ ⎪ [] ← ◾ ⎪ ◾ ⎪ ⎪ ⎨ [ ∗ ] ← ◾ ⧫ [ ∗ ] ∗ 3 ⎪ ⎪ = = ⎪ ◾ ⎪ [ ∗∗ ] ← ◾ ⎩ ⧫ [] ∗ ◾ ⧫ 19

  43. Syntax: examples ⎧ ⎧ ⎪ ⎪ [] ← ◾ ⎪ ⎪ ⎪ ⎪ [ ⎪ ] ⎪ ⎪ ⎪ ] ⎪ [] ← ⎨ [ ∗ ] ← ◾ ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎪ ⎪ 2 1 ⎨ ⎪ [ ∗∗ ] ← ◾ [ ⎩ ] ⎪ ⎪ ⟿ ⎪ ⎪ ◾ ◾ ◾ [[ ∗ ]] ← 2 [ ∗ ] ⎪ [] [ ∗∗ ] ⎪ ⎪ ⎪ 3 ⎪ ⎪ [[ ∗∗ ]] ← 1 ⎩ ◾ Reminder ⧫ {[] ← ◾ ∗ [] 1 = = ◾ ⧫ 19

  44. Syntax: examples ⎧ ⎧ [] ← ◾ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [ ⎪ ⎪ ] ⎪ ⎪ ] [] ← ⎨ [ ∗ ] ← ◾ ⎪ ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎪ ⎪ ⎪ 2 1 ⎨ [ ∗∗ ] ← ◾ [ ⎩ ] ⎪ ⎪ ⟿ ⎪ ⎪ [[ ∗ ]] ← 2 ◾ ◾ ◾ [ ∗ ] ⎪ [] [ ∗∗ ] ⎪ ⎪ ⎪ 3 ⎪ ⎪ [[ ∗∗ ]] ← {[] ← ◾ ⎩ ◾ Reminder ⧫ {[] ← ◾ ∗ [] 1 = = ◾ ⧫ 19

  45. Syntax: examples ⎧ ⎧ [] ← ◾ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [ ⎪ ⎪ ] ⎪ ⎪ ] [] ← ⎨ [ ∗ ] ← ◾ ⎪ ∗ ◾ ◾ ◾ ⎪ [ [] ⎪ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎪ ⎪ ⎪ 2 1 ⎨ [ ∗∗ ] ← ◾ [ ⎩ ] ⎪ ⎪ ⟿ ⎪ ⎪ [[ ∗ ]] ← 2 ◾ ◾ ◾ [ ∗ ] ⎪ [] [ ∗∗ ] ⎪ ⎪ ⎪ 3 ⎪ ⎪ [[ ∗∗ ]] ← {[] ← ◾ ⎩ ◾ Reminder ⧫ ⎧ ∗ [ ∗ ] ⎪ ⎪ [] ← ◾ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ ⧫ 19

  46. Syntax: examples ⎧ ⎧ ⎪ [] ← ◾ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [] ← ⎨ [ ∗ ] ← ◾ [ ⎪ ] ⎪ ⎪ ⎪ ] ⎪ ⎪ ◾ ◾ ∗ ◾ ⎪ [] ⎪ [ ⎪ [ ∗∗ ] ← ◾ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎩ 1 2 ⎨ ⎧ [ ] ⎪ ⎪ [] ← ◾ ⎪ ⎪ ⟿ ⎪ [[ ∗ ]] ← ⎨ ⎪ ◾ ◾ ◾ [ ∗ ] ⎪ [] ⎪ [ ∗∗ ] ⎪ ⎪ [ ∗ ] ← ◾ ⎪ ⎪ 3 ⎩ ⎪ ⎪ ⎪ ⎪ ⎪ [[ ∗∗ ]] ← {[] ← ◾ ⎩ ◾ Reminder ⧫ ∗ ⎧ [ ∗ ] ⎪ [] ← ◾ ⎪ ◾ ⎨ 2 ⎪ [ ∗ ] ← ◾ ⎪ = = ⧫ ⎩ ∗ [] ◾ ⧫ 19

  47. Syntax: examples ⎧ ⎧ ⎪ [] ← ◾ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [] ← ⎨ [ ∗ ] ← ◾ [ ⎪ ] ⎪ ⎪ ⎪ ] ⎪ ⎪ ◾ ◾ ∗ ◾ ⎪ [] ⎪ [ ⎪ [ ∗∗ ] ← ◾ ⎪ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎩ 1 2 ⎨ ⎧ [ ] ⎪ ⎪ [] ← ◾ ⎪ ⎪ ⟿ ⎪ [[ ∗ ]] ← ⎨ ⎪ ◾ ◾ ◾ [ ∗ ] ⎪ [] ⎪ [ ∗∗ ] ⎪ ⎪ [ ∗ ] ← ◾ ⎪ ⎪ 3 ⎩ ⎪ ⎪ ⎪ ⎪ ⎪ [[ ∗∗ ]] ← {[] ← ◾ ⎩ ◾ Reminder { ∗ ← ⧫ ◾ = 19

  48. Syntax: examples ⎧ ⎧ ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [] ← ⎨ [ ∗ ] ← { ∗ ← ⧫ ⎪ [ ⎪ ] ⎪ ⎪ ⎪ ⎪ ] ⎪ ⎪ ◾ ◾ ∗ ◾ [] ⎪ ⎪ [ ⎪ ⎪ [ ∗∗ ] ← { ∗ ← ⧫ [[ ∗ ]] [[ ∗∗ ]] ⎪ ⎩ 2 1 ⎨ [ ] ⎧ ⎪ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ ⟿ ⎪ ⎪ ◾ ◾ ◾ [ ∗ ] ⎪ [[ ∗ ]] ← ⎨ [] ⎪ [ ∗∗ ] ⎪ ⎪ ⎪ [ ∗ ] ← { ∗ ← ⧫ 3 ⎪ ⎪ ⎪ ⎩ ⎪ ⎪ ⎪ ⎪ ◾ ⎪ [[ ∗∗ ]] ← {[] ← { ∗ ← ⧫ ⎩ Reminder { ∗ ← ⧫ ◾ = 19

  49. Syntax Question Is this an opetope? ⎧ ⎧ [ ∗ ] ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [] ← ⎨ [ ∗∗ ] ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [ ∗ ∗ ∗ ] ← ⧫ ⎪ ⎩ ⎪ ⎪ ⎪ ⎪ ⎪ [ ∗∗ ] ← {[] ← {[] ← {[] ← {[] ← {[] ← {[] ← {[] ← {[] ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎧ ⎪ ⎧ ⎪ ⎪ [] ← {[] ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [] ← ⎨ ⎪ [ ∗ ] ← ⧫ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [ ∗∗ ] ← ⧫ ⎪ ⎪ ⎪ ⎩ ⎪ ⎪ [ ∗ ∗ ∗ ] ← ⎨ ⎪ ⎪ ⎪ ⎪ [[]] ← {[] ← { ∗ ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ ⎪ ⎪ ⎪ [[[ ∗ ]]] ← { ∗ ← ⧫ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [[[]]] ← ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ [ ∗ ] ← { ∗ ← ⧫ ⎪ ⎩ ⎪ ⎩ ⎪ ⎪ ⎪ ⎪ [[ ∗ ∗ ∗ ]] ← ⧫ ⎩ 20

  50. Opt ? : a sequent calculus for opetopes

  51. System Opt aims to characterize preopetopes that actually are opetopes. System Opt ? The set of preopetopes P is defined by the following grammar: ::= P ⧫ ⎧ ⎪ ⎪ ⎪ ⎪ A ← P ⎨ | ⎪ ⎪ ⋮ ⎪ ⎪ ⎩ A ← P { { P | 21

  52. System Opt ? The set of preopetopes P is defined by the following grammar: ::= P ⧫ ⎧ ⎪ ⎪ ⎪ ⎪ A ← P ⎨ | ⎪ ⎪ ⋮ ⎪ ⎪ ⎩ A ← P { { P | System Opt ? aims to characterize preopetopes that actually are opetopes. 21

  53. System Opt ? : the point rule The first rule of Opt ? states that we may create points without any prior assumption: point point ⧫ . 22

  54. System Opt ? : the shift rule This rule takes an opetope p and produces a new opetope having a unique node, decorated in p : [ ] ] ◾ ◾ ∗ [ [[ ∗ ]] 2 [ ] ◾ ◾ p [ ∗ ] [] 2 shift {[] ← p ◾ shift [ ] ] ] 2 2 ∗ [ [ [] A 3 23

  55. System Opt ? : the degen rule This rule takes an opetope and produces a degenerate opetope from it: p . degen degen . { { p ⇓ 24

  56. System Opt ? : the graft rule This rule glues an n -opetope q to an ( n + 1 ) -opetope p , the latter really just being a pasting diagram of n -opetopes, and “glues” them together: ⎧ [ a 1 ] ← r 1 ⎪ ⎪ ⎪ ⎪ ⎨ . q ⎪ ⎪ ⋮ ⇓ ⎪ ⇓ ⎪ [ a k ] ← r k ⎩ . . . . ⇓ graft- [ b ] ⎧ ⎪ [ a 1 ] ← r 1 . . ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⇓ ⎨ ⋮ . . . ⎪ ⇓ [ a k ] ← r k ⎪ ⇓ ⎪ ⎪ ⎪ ⎪ . . ⎪ [ b ] ← q ⎩ 25

  57. Main result Theorem Derivable preopetopes in system Opt ? are in bijective correspondence with opetopes. 26

  58. Examples

  59. Examples The proof tree of ⧫ = . is point ⧫ 27

  60. Examples The proof tree of ◾ = . . is point ⧫ shift {[] ← ⧫ 27

  61. Examples The proof tree of ◾ = . . is point ⧫ shift { ∗ ← ⧫ 27

  62. Examples The proof tree of ⧫ ∗ [] 1 = ⟿ ◾ ⇓ . . ⧫ is point ⧫ shift { ∗ ← ⧫ shift {[] ← { ∗ ← ⧫ 27

  63. Examples The proof tree of ⧫ ∗ [ ∗ ] . ◾ 2 = ⟿ ⧫ ∗ ⇓ [] . . ◾ ⧫ is point ⧫ shift { ∗ ← ⧫ point ⧫ shift shift {[] ← { ∗ ← ⧫ {[] ← ⧫ graft- [ ∗ ] {[] ← { ∗ ← ⧫ [ ∗ ] ← { ∗ ← ⧫ 27

  64. Examples The proof tree of [ ∗∗ ] ⧫ ∗ . . ◾ [ ∗ ] ⧫ 3 ∗ = ⇓ ⟿ ◾ [] . . ⧫ ∗ ◾ is ⧫ point ⧫ shift { ∗ ← ⧫ point ⧫ shift shift {[] ← { ∗ ← ⧫ {[] ← ⧫ graft- [ ∗ ] point {[] ← { ∗ ← ⧫ ⧫ shift {[] ← ⧫ [ ∗ ] ← { ∗ ← ⧫ graft- [ ∗∗ ] ⎧ ⎪ [] ← { ∗ ← ⧫ ⎪ ⎪ ⎪ ⎨ [ ∗ ] ← { ∗ ← ⧫ ⎪ ⎪ ⎪ ⎪ [ ∗∗ ] ← { ∗ ← ⧫ ⎩ 27

  65. Examples The proof tree of [ ] ] ◾ ◾ ∗ [ [[ ∗ ]] 2 [ ] . . . . ⇓ ⟿ ⇓ ◾ ◾ ⇛ [ ∗ ] [] ⇓ 2 . . . . ◾ is: ⋮ 2 28

  66. Examples The proof tree of [ ] ] ◾ ◾ ∗ [ [[ ∗ ]] 2 [ ] . . . . ⇓ ⟿ ⇓ ◾ ◾ ⇛ [ ∗ ] [] ⇓ 2 . . . . ◾ is: ⋮ 2 shift {[] ← 2 28

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Intuitionistic sequent-style calculus with explicit structural rules S. Ghilezan 1 c 1 . Lescanne

Intuitionistic sequent-style calculus with explicit structural rules S. Ghilezan 1 c 1 . Lescanne

Motivation - Logic vs Computation Sequent lambda calculus - Gtz Linear Sequent lambda calculus - Gtz Intuitionistic sequent-style calculus with explicit structural rules S. Ghilezan 1 c 1 . Lescanne 2 c 3 J. Iveti D. uni P 1.

598 views • 20 slides
Curry-Howard isomorphism for sequent calculus at last Jos e Carlos Esp rito Santo Centro

Curry-Howard isomorphism for sequent calculus at last Jos e Carlos Esp rito Santo Centro

Introduction Sequent calculus Natural deduction Results Curry-Howard isomorphism for sequent calculus at last Jos e Carlos Esp rito Santo Centro de Matem atica Universidade do Minho Portugal jes@math.uminho.pt Estonian-Finnish

1.36k views • 103 slides
Proofs, upside down A functional correspondence between natural deduction and the sequent calculus

Proofs, upside down A functional correspondence between natural deduction and the sequent calculus

Proofs, upside down A functional correspondence between natural deduction and the sequent calculus Matthias Puech APLAS13 Melbourne, December 11, 2013 1 / 19 An intuition Natural deductions are reversed sequent calculus proofs 2 / 19

955 views • 66 slides
Sequent calculus and extensions of lambda-calculus s Pinto a Lu Dep. Matem atica, Univ.

Sequent calculus and extensions of lambda-calculus s Pinto a Lu Dep. Matem atica, Univ.

Sequent calculus and extensions of lambda-calculus s Pinto a Lu Dep. Matem atica, Univ. Minho, Portugal Seminar at IoC, Tallinn 2nd August 2007 a Joint work with J. Esp rito Santo, M.J. Frade and R. Matthes 1 Plan 1. PART I: The

642 views • 27 slides
Toward dependent choice: a classical sequent calculus with dependent types Hugo Herbelin 1 ,

Toward dependent choice: a classical sequent calculus with dependent types Hugo Herbelin 1 ,

Curry-Howard Axiom of Dependent Choice Sequent calculus State of the art Toward dependent choice: a classical sequent calculus with dependent types Hugo Herbelin 1 , Etienne Miquey 1,2 1 Team r 2 (INRIA), PPS, Universit e

404 views • 24 slides
Computation and Deduction Lecture 19: Cut Elimination Tuesday March 18, 1997 1. Soundness of

Computation and Deduction Lecture 19: Cut Elimination Tuesday March 18, 1997 1. Soundness of

Computation and Deduction Lecture 19: Cut Elimination Tuesday March 18, 1997 1. Soundness of Sequent Calculus 2. Completeness of Sequent Calculus 3. Cut Elimination 19.1 Soundness of Sequent Calculus I ssdc : conc A -> nd A -> type.

583 views • 9 slides
INF3170 / INF4171 Soundness and completeness of sequent calculus Andreas Nakkerud September 14,

INF3170 / INF4171 Soundness and completeness of sequent calculus Andreas Nakkerud September 14,

Syntax of propositional logic Semantics of propositional logic Sequent calculus Soundness Completeness Model existence theorem INF3170 / INF4171 Soundness and completeness of sequent calculus Andreas Nakkerud September 14, 2016 Syntax of

1.13k views • 71 slides
The Duality of Construction Paul Downen Zena M. Ariola University of Oregon April 9, 2014 The

The Duality of Construction Paul Downen Zena M. Ariola University of Oregon April 9, 2014 The

The Duality of Construction Paul Downen Zena M. Ariola University of Oregon April 9, 2014 The sequent calculus Sequent calculus vs. Natural deduction Natural deduction tells us about pure functional programming Sequent calculus tells

576 views • 44 slides
The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus Marianna Girlando,

The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus Marianna Girlando,

The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus Marianna Girlando, Sara Negri, Nicola Olivetti, Vincent Risch Aix Marseille Universit e, Laboratoire des Sciences de lInformation et des Syst` emes; University

600 views • 37 slides
Handling Javas Abrupt Termination in a Sequent Calculus for Dynamic Logic Bernhard Beckert

Handling Javas Abrupt Termination in a Sequent Calculus for Dynamic Logic Bernhard Beckert

Handling Javas Abrupt Termination in a Sequent Calculus for Dynamic Logic Bernhard Beckert Bettina Sasse U NIVERSITY OF K ARLSRUHE I NSTITUTE FOR L OGIC , C OMPLEXITY AND D EDUCTION S YSTEMS i12www.ira.uka.de/ key VerifiCard Workshop

604 views • 33 slides
A sequent calculus for a semi-associative law 1 Noam Zeilberger University of Birmingham

A sequent calculus for a semi-associative law 1 Noam Zeilberger University of Birmingham

A sequent calculus for a semi-associative law 1 Noam Zeilberger University of Birmingham 25-May-2018 CLA 2018 (Paris) 1 Based on a paper: https://arxiv.org/abs/1803.10080 1 / 33 Introduction 2 / 33 The Tamari order The partial order on

689 views • 33 slides
Sequent Calculus as a Compiler Intermediate Language Paul Downen 1 Luke Maurer 1 Zena M. Ariola 1

Sequent Calculus as a Compiler Intermediate Language Paul Downen 1 Luke Maurer 1 Zena M. Ariola 1

Sequent Calculus as a Compiler Intermediate Language Paul Downen 1 Luke Maurer 1 Zena M. Ariola 1 Simon Peyton Jones 2 1 University of Oregon 2 Microsoft Research Cambridge ICFP16, September 18 28, 2016 Curry-Howard in theory and practice

705 views • 29 slides
Proof search in intuitionistic sequent calculus and admissible rules Paul Rozire Equipe PPS,

Proof search in intuitionistic sequent calculus and admissible rules Paul Rozire Equipe PPS,

Proof search in intuitionistic sequent calculus and admissible rules Paul Rozire Equipe PPS, CNRS UMR 7126 Universit Paris DiderotParis 7 Workshop on Admissible Rules and Unification Utrecht University May 26-28, 2011 Foreword The

454 views • 20 slides
Normal forms in sequent calculus Lu s Pinto Centro de Matem atica, Univ. Minho, Portugal

Normal forms in sequent calculus Lu s Pinto Centro de Matem atica, Univ. Minho, Portugal

Normal forms in sequent calculus Lu s Pinto Centro de Matem atica, Univ. Minho, Portugal Computational Logic Workshop in honour of Roy Dyckhoff 18-19 November 2011 Univ. St Andrews, Scotland Joint work with Jos e Esp rito Santo

718 views • 59 slides
Logic in Logic Programming: Sequent Calculus, Higher-Orders, and Linear Logic Fourth

Logic in Logic Programming: Sequent Calculus, Higher-Orders, and Linear Logic Fourth

Logic in Logic Programming: Sequent Calculus, Higher-Orders, and Linear Logic Fourth International School for Computer Science Researchers Acireale, Sicily 29 June 3 July 1992 Dale Miller Computer Science Department University of

875 views • 86 slides
Absorbing the Structural Rules in the Sequent Calculus with Additional Atomic Rules Franco

Absorbing the Structural Rules in the Sequent Calculus with Additional Atomic Rules Franco

Absorbing the Structural Rules in the Sequent Calculus with Additional Atomic Rules Franco Parlamento University of Udine Flavio Previale University of Turin Logic Colloquium 2018 Udine July 27th 2018 Absorbing the Structural Rules in the

1.43k views • 71 slides
Cell structures for finite subset spaces Christopher Tuffley Institute of Fundamental Sciences

Cell structures for finite subset spaces Christopher Tuffley Institute of Fundamental Sciences

Cell structures for finite subset spaces Christopher Tuffley Institute of Fundamental Sciences Massey University, Palmerston North 7th Australia New Zealand Mathematics Convention December 2008 Christopher Tuffley (Massey University) Cell

757 views • 40 slides
Cell Division Comics Using abstraction to represent a complex scientific topic in a simple,

Cell Division Comics Using abstraction to represent a complex scientific topic in a simple,

Cell Division Comics Using abstraction to represent a complex scientific topic in a simple, artistic way. Cell Division Comics activity You are going to create a comic strip that all about cell division. Your comic can be funny, colorful,

225 views • 8 slides
Diffusion Contaminant at Contaminant Solutes (contaminants) migrate due to concentration

Diffusion Contaminant at Contaminant Solutes (contaminants) migrate due to concentration

Diffusion Contaminant at Contaminant Solutes (contaminants) migrate due to concentration concentration = 0 C 0 at t 0 their chemical activity in the absence of at t 0 bulk fluid flow. From higher concentration to lower concentration

599 views • 11 slides
CSEP 517: Natural Language Processing Recurrent Neural Networks Autumn 2018 Luke Zettlemoyer

CSEP 517: Natural Language Processing Recurrent Neural Networks Autumn 2018 Luke Zettlemoyer

CSEP 517: Natural Language Processing Recurrent Neural Networks Autumn 2018 Luke Zettlemoyer University of Washington [most slides from Yejin Choi] RECURRENT NEURAL L NE NETWOR WORKS Recurrent Neural Networks (RNNs) Each input

787 views • 29 slides
AMMI Introduction to Deep Learning 11.2. LSTM and GRU Fran cois Fleuret

AMMI Introduction to Deep Learning 11.2. LSTM and GRU Fran cois Fleuret

AMMI Introduction to Deep Learning 11.2. LSTM and GRU Fran cois Fleuret https://fleuret.org/ammi-2018/ November 12, 2018 COLE POLYTECHNIQUE FDRALE DE LAUSANNE The Long-Short Term Memory unit (LSTM) by Hochreiter and Schmidhuber

310 views • 30 slides
On the universal optimality of the 600 -cell: the Levenshtein framework lifted Peter Dragnev

On the universal optimality of the 600 -cell: the Levenshtein framework lifted Peter Dragnev

On the universal optimality of the 600 -cell: the Levenshtein framework lifted Peter Dragnev Purdue University Fort Wayne Joint work with: P. Boyvalenkov (Bulgarian Academy of Sciences), D. Hardin, E. Saff (Vanderbilt), M. Stoyanova (Sofia

705 views • 48 slides
RoboCup Challenges Simulation League Small League Medium-sized League (less

RoboCup Challenges Simulation League Small League Medium-sized League (less

Robotics (c) 2003 Thomas G. Dietterich 1 RoboCup Challenges Simulation League Small League Medium-sized League (less interest) SONY Legged League Humanoid League (c) 2003 Thomas G. Dietterich 2 1 Small League

546 views • 25 slides
Automatic Cell Layout in the 7nm Era Pascal Cremer , Stefan Hougardy, Jan Schneider, and Jannik

Automatic Cell Layout in the 7nm Era Pascal Cremer , Stefan Hougardy, Jan Schneider, and Jannik

Automatic Cell Layout in the 7nm Era Pascal Cremer , Stefan Hougardy, Jan Schneider, and Jannik Silvanus Research Institute for Discrete Mathematics University of Bonn March 21, 2017 1 / 24 Increasing complexity in 7nm cell design SADP / SAQP

573 views • 31 slides

More recommend