plan
play

Plan Discrete paths as Heyting algebras Discrete paths as - PowerPoint PPT Presentation

Sep 19, 2022 •222 likes •1.31k views

Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Algebra and logic of discrete paths 1 Luigi Santocanale LIS (team LIRICA), Aix-Marseille Universit e, France S

  1. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Heyting implication of paths In every finite distributive lattice  ⊤ , x ≤ y , �  { z | z ∧ x ≤ y } = ∗  x → y =   y , y < x ,   * : if the lattice is a chain. We can compute π 1 → π 2 as follows: 7/33

  2. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Heyting implication of paths In every finite distributive lattice  ⊤ , x ≤ y , �  { z | z ∧ x ≤ y } = ∗  x → y =   y , y < x ,   * : if the lattice is a chain. We can compute π 1 → π 2 as follows: 7/33

  3. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Heyting implication of paths In every finite distributive lattice  ⊤ , x ≤ y , �  { z | z ∧ x ≤ y } = ∗  x → y =   y , y < x ,   * : if the lattice is a chain. We can compute π 1 → π 2 as follows: 7/33

  4. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The equational theory of the P ( n , m ) ? Problem: characterize the equational theory of the P ( n , m ) . That is : what are the IPC (Intuitionistic Propositonal Calculus) formulas that are true in this kind of models? 8/33

  5. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The equational theory of the P ( n , m ) ? Problem: characterize the equational theory of the P ( n , m ) . That is : what are the IPC (Intuitionistic Propositonal Calculus) formulas that are true in this kind of models? An example, Gabbay/De Jong formula(s): for each n , m , � � � P ( n , m ) | = (( p i → p j ) → p j ) . i = 1 , 2 , 3 j � i j � i 8/33

  6. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Plan Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions 9/33

  7. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Composition of paths/words? SLatt is a category, can we characterize composition? ≃ SLatt ([ n ] + , [ m ] + ) × SLatt ([ m ] + , [ k ] + ) P( n , m ) × P( m , k ) ? ◦ ⊗ ≃ SLatt ([ n ] + , [ k ] + ) P( n , k ) 10/33

  8. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . 11/33

  9. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . y y y x x xx y y y zz z 11/33

  10. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . y y y x x xx y y y zz z 11/33

  11. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . y y y x x xx x xzz xx z y y y zz z 11/33

  12. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . y y y x xzz xx z y y y 11/33

  13. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . x xzz xx z 11/33

  14. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The product ⊗ on binary words as synchronisation By example: xyxyxxy ∈ P x , y ( 4 , 3 ) and yzzyyz ∈ P y , z ( 3 , 3 ) . x xzz xx z xyxyxxy ⊗ yzzyyz = xxzzxxz ∈ P x , z ( 4 , 3 ) . 11/33

  15. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The category P of discrete words/paths • Objects: natural numbers 0 , 1 , . . . , n , . . . • An arrow from n to m is a word w ∈ P ( n , m ) , • Composition is ⊗ (up to renaming of letters). 12/33

  16. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations Given f ∈ SLatt ([ n ] + , [ k ] + ) and m ≥ 0, how many g ∈ SLatt ([ n ] + , [ m ] + ) and h ∈ SLatt ([ m ] + , [ k ] + ) are there such that f = h ◦ g ? [ m ] + g h [ n ] + [ k ] + f 13/33

  17. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. 14/33

  18. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzzxzzzxx 14/33

  19. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzz | xzzz | xx 14/33

  20. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzz | xz | zz | x | x 14/33

  21. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzz | xz | zz | x | x yielding xyxyyxyx zzyzyzzyy 14/33

  22. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzzxz | zzx | x yielding xyxyyxyx zzyzyzzyy � n + k + m − i � n + k 14/33

  23. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzzxz | zzx | x yielding xyxyyxyx zzyzyzzyy � n + k + m − i �� n �� k � n + k i i 14/33

  24. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzzxz | zzx | x yielding xyxyyxyx zzyzyzzyy m � n + m �� m + k � � n + k + m − i �� n �� k � � = n + k n k i i i = 0 14/33

  25. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting factorizations by NE-turns Guess right places where to put m vertical bars. Here xzzxzzzxx has i = 2 NE-turns, we want to insert m = 4 bars. xzzxz | zzx | x yielding xyxyyxyx zzyzyzzyy Worpitzky style identity (Dzhumadil` daev, 2011): m � n + m �� m + k � � n + k + m − i �� n �� k � � = n + k n k i i i = 0 14/33

  26. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Plan Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions 15/33

  27. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a quantale • For each n , m P ( n , m ) is a poset. • Actually, it is a (complete and distributive) lattice. • ⊗ distributes with suprema: � � � w i ⊗ u j = w i ⊗ u j . i ∈ I j ∈ J ( i , j ) ∈ I × J • We have � � w ⊸ u := { v | w ⊗ v ≤ u } , u � w := { v | v ⊗ w ≤ u } . 16/33

  28. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a quantale • For each n , m P ( n , m ) is a poset. • Actually, it is a (complete and distributive) lattice. • ⊗ distributes with suprema: � � � w i ⊗ u j = w i ⊗ u j . i ∈ I j ∈ J ( i , j ) ∈ I × J • We have � � w ⊸ u := { v | w ⊗ v ≤ u } , u � w := { v | v ⊗ w ≤ u } . A quantale is a monoid object in SLatt (a model of non-commutative intuitionistic propositional linear logic). 16/33

  29. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a quantale • For each n , m P ( n , m ) is a poset. • Actually, it is a (complete and distributive) lattice. • ⊗ distributes with suprema: � � � w i ⊗ u j = w i ⊗ u j . i ∈ I j ∈ J ( i , j ) ∈ I × J • We have � � w ⊸ u := { v | w ⊗ v ≤ u } , u � w := { v | v ⊗ w ≤ u } . A quantale is a monoid object in SLatt (a model of non-commutative intuitionistic propositional linear logic). Proposition For each n ≥ 1, P ( n , n ) is a quantale. 16/33

  30. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Quantales and residuated lattices Not exactly the same thing, but strictly related. A residuated lattice is an algebra for the signature ⊤ , ∧ , ⊥ , ∨ , 1 , ⊗ , ⊸ , � , satisfying a bunch of axioms. 17/33

  31. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Reflection as linear negation y x x y y x x y y x x y y x x y y x 18/33

  32. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Reflection as linear negation y x x y y x x y y x x y y x x y y x Reflection (exchange of x s and y s) yields a linear negation: ( · ) ⋆ : P ( n , m ) − → P ( m , n ) − − − such that u ⊗ z ⋆ ≤ w ⋆ z ⋆ ⊗ w ≤ u ⋆ . w ⊗ u ≤ z iff iff 18/33

  33. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The dual product ⊕ Recall: xyxyxxy ⊗ yzzyyz = x | xzz | xx | z . 19/33

  34. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The dual product ⊕ Recall: xyxyxxy ⊗ yzzyyz = x | xzz | xx | z . We can also define xyxyxxy ⊕ yzzyyz := x | zzx | xx | z . 19/33

  35. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions The dual product ⊕ Recall: xyxyxxy ⊗ yzzyyz = x | xzz | xx | z . We can also define xyxyxxy ⊕ yzzyyz := x | zzx | xx | z . Then, we have w ⊕ u = ( u ⋆ ⊗ w ⋆ ) ⋆ . 19/33

  36. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a Girard quantale A Girard quantale (or involutive residuated lattice ) is quantale coming with a “good” involution . . . 20/33

  37. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a Girard quantale A Girard quantale (or involutive residuated lattice ) is quantale coming with a “good” involution . . . That is, it is • a model of non-commutative classical cyclic propositional linear logic, or • a non-symmetric ∗ -autonomous poset. 20/33

  38. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions P ( n , n ) as a Girard quantale A Girard quantale (or involutive residuated lattice ) is quantale coming with a “good” involution . . . That is, it is • a model of non-commutative classical cyclic propositional linear logic, or • a non-symmetric ∗ -autonomous poset. Proposition For each n ≥ 1, P ( n , n ) is a Girard quantale. 20/33

  39. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Plan Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions 21/33

  40. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Why idempotents? • As in standard algebra, idempotents play an important role. • Conguences of residuated lattices: analogous to normal subgroups of a group. 22/33

  41. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Why idempotents? • As in standard algebra, idempotents play an important role. • Conguences of residuated lattices: analogous to normal subgroups of a group. • f is idempotent : f ◦ f = f , • f is central : f ◦ g = g ◦ f , for each g . 22/33

  42. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Why idempotents? • As in standard algebra, idempotents play an important role. • Conguences of residuated lattices: analogous to normal subgroups of a group. • f is idempotent : f ◦ f = f , • f is central : f ◦ g = g ◦ f , for each g . Lemma If L is a finite residuated lattice, then the central idempotent elements below the unit are in bijective correspondence with the congruences. 22/33

  43. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Why idempotents? • As in standard algebra, idempotents play an important role. • Conguences of residuated lattices: analogous to normal subgroups of a group. • f is idempotent : f ◦ f = f , • f is central : f ◦ g = g ◦ f , for each g . Lemma If L is a finite residuated lattice, then the central idempotent elements below the unit are in bijective correspondence with the congruences. Proposition For each n , P ( n , n ) is simple (=no nontrivial congruences). For each complete lattice L , SLatt ( L , L ) is simple. 22/33

  44. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Idempotents as emmentalers Definition Let L be a complete lattice. An emmentaler of L is a collection { [ y i , x i ] | i ∈ I } of pairwise disjoint intervals of L such that • { y i | i ∈ I } closed under infs, • { x i | i ∈ I } closed under sups. Proposition Let • L be a complete lattice, • f : L − → L sup-preserving and idempotent, • g be the right-adjoint of f . Then { [ f ( x ) , g ( f ( x ))] | x ∈ L } is an emmentaler of L . This sets up a bijective correspondence between idempotents and emmentalers. 23/33

  45. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n 24/33

  46. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n 24/33

  47. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n x 2 y 2 x 1 y 1 x 0 y 0 24/33

  48. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n x 2 y 2 x 1 y 1 x 0 y 0 24/33

  49. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n x 2 y 2 x 1 y 1 x 0 y 0 24/33

  50. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n x 2 y 2 x 1 y 1 x 0 y 0 24/33

  51. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n x 2 y 2 x 1 y 1 x 0 y 0 24/33

  52. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n 24/33

  53. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n 24/33

  54. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Emmentalers of [ n ] + as (upper) zigzags An emmentaler becomes an alternating sequence 0 = y 0 ≤ x 0 < y 1 ≤ x 1 < . . . y k ≤ x k = n Definition A path w is an upper zigzag if every NE-turn is above y = x + 1 2 , every EN-turn is below this line. 24/33

  55. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting idempotents P n := P ( n , n ) , O n := { f : [ n ] − → [ n ] | f monotone } ≃ { w ∈ P n | height w ( 1 ) ≥ 1 } . 25/33

  56. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting idempotents P n := P ( n , n ) , O n := { f : [ n ] − → [ n ] | f monotone } ≃ { w ∈ P n | height w ( 1 ) ≥ 1 } . Howie 1971, Laradji and Umar 2006: | E ( O n ) | = Fib 2 n , |{ f ∈ E ( O n ) | f ( n ) = n }| = Fib 2 n − 1 . 25/33

  57. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting idempotents P n := P ( n , n ) , O n := { f : [ n ] − → [ n ] | f monotone } ≃ { w ∈ P n | height w ( 1 ) ≥ 1 } . Howie 1971, Laradji and Umar 2006: | E ( O n ) | = Fib 2 n , |{ f ∈ E ( O n ) | f ( n ) = n }| = Fib 2 n − 1 . Combinatorial interpretation/bijective proof: Proposition • The number of upper zigzags in P n equals Fib 2 n + 1 . • The number of upper zigzags in P n with y as a first step equals Fib 2 n . 25/33

  58. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Fibonacci sequences Recursive formulas: Fib 2 n + 2 = Fib 2 n + 1 + Fib 2 n , Fib 2 n + 3 = Fib 2 n + 2 + Fib 2 n + 1 . 26/33

  59. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Fibonacci sequences Recursive formulas: Fib 2 n + 2 = Fib 2 n + 1 + Fib 2 n , Fib 2 n + 3 = Fib 2 n + 2 + Fib 2 n + 1 . Whence we need to show that: | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 26/33

  60. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, I | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 27/33

  61. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, I | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 27/33

  62. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, I | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 27/33

  63. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, I | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 27/33

  64. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, II | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 28/33

  65. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, II | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 28/33

  66. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, II | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | , | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 28/33

  67. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, III | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 29/33

  68. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, III | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 29/33

  69. Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Counting upper zigzags, III | E ( O n + 1 ) | = | E ( P n ) | + | E ( O n ) | | E ( P n + 1 ) | = | E ( O n + 1 ) | + | E ( P n ) | . 29/33

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

PHASE IA PLAN ULTIMATE PLAN 13 PHASE IB PLAN ULTIMATE PLAN 14 ULTIMATE PLAN ULTIMATE PLAN

PHASE IA PLAN ULTIMATE PLAN 13 PHASE IB PLAN ULTIMATE PLAN 14 ULTIMATE PLAN ULTIMATE PLAN

PHASE IA PLAN ULTIMATE PLAN 13 PHASE IB PLAN ULTIMATE PLAN 14 ULTIMATE PLAN ULTIMATE PLAN 15 FOR ILLUSTRATIVE PURPOSES ONLY - - - FIGURE 11 - Leeward Community College Station Area Illustrative Plan 52

74 views • 4 slides
To Plan or Not To Plan Failure to plan is a plan to fail Questions to ask yourself Who is this

To Plan or Not To Plan Failure to plan is a plan to fail Questions to ask yourself Who is this

To Plan or Not To Plan Failure to plan is a plan to fail Questions to ask yourself Who is this for? Who Is this something that the scouts want to do? Do you have adults to supervise, drive, etc? What exactly will the trip entail? Is it

428 views • 10 slides
( ) + ( ) + ( ) + What is an Area Plan ( ) + What is an Area Plan A Comprehensive

( ) + ( ) + ( ) + What is an Area Plan ( ) + What is an Area Plan A Comprehensive

Greater Downtown Area Plan ( ) + ( ) + ( ) + What is an Area Plan ( ) + What is an Area Plan A Comprehensive Plan deals with an entire city. FOCUS is an example of a Comprehensive Plan. An Area Plan takes the broad recommendations

435 views • 31 slides
Best Available Technology SUPPLEMENTAL INFORMATION VMT C-Plan Components 4 Plan

Best Available Technology SUPPLEMENTAL INFORMATION VMT C-Plan Components 4 Plan

Valdez Marine Terminal Oil Discharge Prevention and Contingency Plan Linda Swiss, C-Plan Project Manager Austin Love, TOEM Project Manager September 2015 PWSRCAC Board Meeting VMT C-Plan update Contingency plans Plan review/renewal

600 views • 8 slides
Plan Growth Company Stats Plan Growth Plan Growth 133,527 91,873 66,972 48,573 28,369

Plan Growth Company Stats Plan Growth Plan Growth 133,527 91,873 66,972 48,573 28,369

Plan Growth Company Stats Plan Growth Plan Growth 133,527 91,873 66,972 48,573 28,369 9,674 2011 2012 2013 2014 2015 2016 Reach Your Potential P LAN S PONSOR L INK M OBILE Securely deliver files and automate Search contacts or

469 views • 21 slides
STRATEGI C PLAN 20 18 -20 23 DEVELOPM ENT OF ASI S STRATEGI C PLAN THE STRATEGIC PLAN

STRATEGI C PLAN 20 18 -20 23 DEVELOPM ENT OF ASI S STRATEGI C PLAN THE STRATEGIC PLAN

STRATEGI C PLAN 20 18 -20 23 DEVELOPM ENT OF ASI S STRATEGI C PLAN THE STRATEGIC PLAN Guideline that charts a course for the next 5 years A living document flexible and allows for change Based on current state of A.S.I. AND

689 views • 34 slides
Master Plan Open House #3 Preferred Alternative Master Plan Master Plan Process What is a

Master Plan Open House #3 Preferred Alternative Master Plan Master Plan Process What is a

Eagles View Park Master Plan Open House #3 Preferred Alternative Master Plan Master Plan Process What is a Master Plan? Associated Planning Documents Comprehensive Park System Master Plan West Salem Neighborhood Plan - 2004

602 views • 16 slides
DISTRICT PLANS 2 Financial Plan Instructional Plan Strategic Plan STRATEGIC PLAN GOALS 3

DISTRICT PLANS 2 Financial Plan Instructional Plan Strategic Plan STRATEGIC PLAN GOALS 3

Board Workshop #1: 2018-2019 Budget 1 EAST GREENBUSH CENTRAL SCHOOL DISTRICT Jeffrey P. Simons Superintendent of Schools March 14, 2018 DISTRICT PLANS 2 Financial Plan Instructional Plan Strategic Plan STRATEGIC PLAN GOALS 3 Maintain

1k views • 25 slides
Retirement Plan Information Session Todays meeting Why plan for retirement? Your Plan

Retirement Plan Information Session Todays meeting Why plan for retirement? Your Plan

Retirement Plan Information Session Todays meeting Why plan for retirement? Your Plan Your investment options GWL Services and support Why plan? Someone is sitting in the shade today because someone planted a tree

1.04k views • 31 slides
40 Accident Plan Accident Plan New plan for 1/1/18 44,500 enrolled to date To date

40 Accident Plan Accident Plan New plan for 1/1/18 44,500 enrolled to date To date

40 Accident Plan Accident Plan New plan for 1/1/18 44,500 enrolled to date To date - 677 claims filed with the average claim paying out $1,200 Benefits are paid directly to member Sport rider additional payout - up to

336 views • 9 slides
What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the

What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the

What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the vision and policies for the future development of a local area. Once made by the local planning authority it forms part of the statutory

204 views • 16 slides
What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the

What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the

What is a Neighbourhood Plan? A Neighbourhood Plan is a community led plan that sets out the vision and policies for the future development of a local area. Once made by the local planning authority it forms part of the statutory

426 views • 17 slides
Par Partnership ip Plan Plan 2.0 UnitedHealthcare re/Ox Oxfo ford rd w welcomes You t to

Par Partnership ip Plan Plan 2.0 UnitedHealthcare re/Ox Oxfo ford rd w welcomes You t to

Par Partnership ip Plan Plan 2.0 UnitedHealthcare re/Ox Oxfo ford rd w welcomes You t to the State o of Co Conne nnecticut Partnership Plan n 2.0 Benefits: The Partnership Plan 2.0 offers a rich plan design, featuring the same no

276 views • 12 slides
MESA/POWDERHORN PLAN UPDATE Meeting 3 October 23, 2012 Agenda 2 Plan Purpose Plan Area

MESA/POWDERHORN PLAN UPDATE Meeting 3 October 23, 2012 Agenda 2 Plan Purpose Plan Area

MESA/POWDERHORN PLAN UPDATE Meeting 3 October 23, 2012 Agenda 2 Plan Purpose Plan Area Boundaries Plan Outline Vision Statement Goals, Policies and Actions Future Land Use Appendix: Design Guidelines Plan Purpose 3

258 views • 21 slides
Retirement Plan Changes Update Overview Retirement Plan Options at W&amp;M No changes to

Retirement Plan Changes Update Overview Retirement Plan Options at W&amp;M No changes to

Retirement Plan Changes Update Overview Retirement Plan Options at W&amp;M No changes to Defined Benefit Plans or VRS Hybrid Plan or 457 Deferred Compensation Plan 2 Plan Changes Optional Retirement Plan Opt-Out 403(b) Tax Deferred

324 views • 28 slides
SAN TAN VALLEY AREA PLAN Community Development Department 7/06/16 San Tan Valley Area Plan

SAN TAN VALLEY AREA PLAN Community Development Department 7/06/16 San Tan Valley Area Plan

SAN TAN VALLEY AREA PLAN Community Development Department 7/06/16 San Tan Valley Area Plan Strategic Plan Goal: 2014 What is an Area Plan? More detail than comprehensive plan but much larger than an neighborhood plan Adopted

311 views • 10 slides
Discriminator Varieties of Double-Heyting Algebras Christopher Taylor Supervised by Dr. Tomasz

Discriminator Varieties of Double-Heyting Algebras Christopher Taylor Supervised by Dr. Tomasz

Background Congruences in Double-Heyting Algebras Discriminator Varieties in Double-Heyting Algebras Discriminator Varieties of Double-Heyting Algebras Christopher Taylor Supervised by Dr. Tomasz Kowalski and Emer. Prof. Brian Davey

473 views • 28 slides
Fair Stable Matchings Christine T. Cheng University of Wisconsin-Milwaukee April 17, 2015

Fair Stable Matchings Christine T. Cheng University of Wisconsin-Milwaukee April 17, 2015

Fair Stable Matchings Christine T. Cheng University of Wisconsin-Milwaukee April 17, 2015 Christine T. Cheng University of Wisconsin-Milwaukee Fair Stable Matchings Why study fair stable matchings? In spite of the fact that an instance can

1.2k views • 105 slides
Discrete duality for downset lattices and their Positive Modal Logic residuated operations

Discrete duality for downset lattices and their Positive Modal Logic residuated operations

Duality and Residuation Sam van Gool Discrete Duality Discrete duality for downset lattices and their Positive Modal Logic residuated operations Residuation Research Question Sam van Gool 30 October 2010 The categorical flow of

1.04k views • 66 slides
On the Reaxiomatisation of General Topology Paul Taylor Department of Computer Science

On the Reaxiomatisation of General Topology Paul Taylor Department of Computer Science

On the Reaxiomatisation of General Topology Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR / S58522 White Point, Nova Scotia Monday, 26 June 2006 www.cs.man.ac.uk / pt / ASD Topological spaces A

871 views • 62 slides
Distributive mereotopology Tatyana Ivanova and Dimiter Vakarelov Faculty of Mathematics and

Distributive mereotopology Tatyana Ivanova and Dimiter Vakarelov Faculty of Mathematics and

Distributive mereotopology Tatyana Ivanova and Dimiter Vakarelov Faculty of Mathematics and Informatics Sofia university Advances in Modal Logic, 30 August - 2 September, 2016, Budapest, Hungary Supported by the Science Fund of Sofia

299 views • 29 slides
On the Essence and Initiality of Conflicts Guilherme Grochau Azzi 1 , Andrea Corradini 2 and Leila

On the Essence and Initiality of Conflicts Guilherme Grochau Azzi 1 , Andrea Corradini 2 and Leila

Introduction Characterization Properties Previous Work Initial Conflicts Conclusions On the Essence and Initiality of Conflicts Guilherme Grochau Azzi 1 , Andrea Corradini 2 and Leila Ribeiro 1 1 Instituto de Informtica Universidade Federal

1.19k views • 93 slides
Arrow Categories Michael Winter Department of Computer Science Brock University St. Catharines,

Arrow Categories Michael Winter Department of Computer Science Brock University St. Catharines,

Arrow Categories Michael Winter Department of Computer Science Brock University St. Catharines, Canada mwinter@brocku.ca Content 1. Binary (Boolean valued), fuzzy and L -fuzzy relations 2. Dedekind categories (Boolean valued relations) 3.

424 views • 24 slides
Planar Semimodular Lattices: Structure and Diagrams G abor Cz edli and George Gr

Planar Semimodular Lattices: Structure and Diagrams G abor Cz edli and George Gr

Planar Semimodular Lattices: Structure and Diagrams G abor Cz edli and George Gr atzer . Nov y Smokovec, High Tatras, Slovakia, Sept 27, 2012 2012. szeptember 3. http://www.math.u-szeged.hu/ czedli/ ,

1.36k views • 120 slides

More recommend