Events - August 2015

Thursday, August 27, 2015 — 2:00 PM EDT

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“Embedding Lattices in the Computably Enumerable Degrees (Part 4)”

Thursday, August 20, 2015 — 2:00 PM EDT

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“Embedding Lattices in the Computably Enumerable Degrees (Part 3)”

Wednesday, August 19, 2015 — 1:30 PM EDT

Anthony McCormick, Pure Math Department, University of Waterloo

“Iterated Function Systems with Overlap”

Friday, August 14, 2015 — 10:30 AM EDT

Jim Haley, Pure Mathematics, University of Waterloo

"Strongly Reductive Operators and Operator Algebras"

Thursday, August 13, 2015 — 2:00 PM EDT

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices in the Computably Enumerable Degrees (continued)"

This talk is a continuation of one given August 6th.

Thursday, August 13, 2015 — 10:30 AM EDT

Ehsaan Hossain, Pure Mathematics, University of Waterloo

"The Algebraic Kirchberg--Phillips Conjecture"

Wednesday, August 12, 2015 — 10:30 AM EDT

Zack Cramer, Pure Mathematics, University of Waterloo

"Approximation of Normal Operators by Nilpotents in Purely Infinite $C^*$-algebras"

Friday, August 7, 2015 — 10:30 AM EDT

Sam Harris, Pure Mathematics, University of Waterloo

"Kadison Similarity Problem and the Similarity Degree"

Thursday, August 6, 2015 — 2:00 PM EDT

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices into the Computably Enumerable Degrees"

The question of which finite lattices can be embedded into the c.e.
degrees first arose with the construction of a minimal pair by Yates,
and independently by Lachlan, showing the 4 element Boolean algebra
can be embedded. This result was rapidly generalised to show any
finite distributive lattice can also be embedded. For non-distributive
lattices, the situation is more complicated.

Tuesday, August 4, 2015 — 1:30 PM EDT

Stanley Burris, Pure Mathematics, University of Waterloo

"An Introduction to Boole's Algebra of Logic for Classes"

Boole's mysterious algebra of logic, based on the algebra of numbers and idempotent variables, has only been properly understood and justified in the last 40 years, more than a century after Boole published his most famous work, Laws of Thought. In this talk an elementary and natural development of Boole's system, from his partial algebra models up to his four main theorems, will be presented.

S M T W T F S
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2019 (139)
    1. September (5)
    2. August (7)
    3. July (12)
    4. June (18)
    5. May (22)
    6. April (11)
    7. March (25)
    8. February (17)
    9. January (22)
  2. 2018 (219)
    1. December (2)
    2. November (32)
    3. October (27)
    4. September (26)
    5. August (4)
    6. July (9)
    7. June (13)
    8. May (17)
    9. April (13)
    10. March (28)
    11. February (27)
    12. January (21)
  3. 2017 (281)
  4. 2016 (335)
  5. 2015 (209)
    1. December (7)
    2. November (39)
    3. October (38)
    4. September (15)
    5. August (10)
    6. July (18)
    7. June (24)
    8. May (12)
    9. April (2)
    10. March (27)
    11. January (17)
  6. 2014 (235)
  7. 2013 (251)
  8. 2012 (135)